Binary multi-verse optimization algorithm for global optimization and discrete problems
Published 2019 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Binary multi-verse optimization algorithm for global optimization and discrete problems
Authors
Keywords
Feature selection, Optimization, Multi-verse optimization algorithm, Global optimization
Journal
International Journal of Machine Learning and Cybernetics
Volume -, Issue -, Pages -
Publisher
Springer Nature
Online
2019-02-05
DOI
10.1007/s13042-019-00931-8
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Asynchronous accelerating multi-leader salp chains for feature selection
- (2018) Ibrahim Aljarah et al. APPLIED SOFT COMPUTING
- Binary Grasshopper Optimisation Algorithm Approaches for Feature Selection Problems
- (2018) Majdi Mafarja et al. EXPERT SYSTEMS WITH APPLICATIONS
- An intelligent system for spam detection and identification of the most relevant features based on evolutionary Random Weight Networks
- (2018) Hossam Faris et al. Information Fusion
- Training feedforward neural networks using multi-verse optimizer for binary classification problems
- (2016) Hossam Faris et al. APPLIED INTELLIGENCE
- A feature selection method based on modified binary coded ant colony optimization algorithm
- (2016) Youchuan Wan et al. APPLIED SOFT COMPUTING
- Binary grey wolf optimization approaches for feature selection
- (2016) E. Emary et al. NEUROCOMPUTING
- Multi-Verse Optimizer: a nature-inspired algorithm for global optimization
- (2015) Seyedali Mirjalili et al. NEURAL COMPUTING & APPLICATIONS
- Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization
- (2015) Yanhong Feng et al. NEURAL COMPUTING & APPLICATIONS
- Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems
- (2015) Seyedali Mirjalili NEURAL COMPUTING & APPLICATIONS
- A Complex-valued Encoding Bat Algorithm for Solving 0–1 Knapsack Problem
- (2015) Yongquan Zhou et al. NEURAL PROCESSING LETTERS
- Shuffled frog leaping algorithm and its application to 0/1 knapsack problem
- (2014) Kaushik Kumar Bhattacharjee et al. APPLIED SOFT COMPUTING
- A discrete binary version of bat algorithm for multidimensional knapsack problem
- (2014) Sara Sabba et al. International Journal of Bio-Inspired Computation
- Solving 0–1 Knapsack Problem using Cohort Intelligence Algorithm
- (2014) Anand J. Kulkarni et al. International Journal of Machine Learning and Cybernetics
- Binary bat algorithm
- (2013) Seyedali Mirjalili et al. NEURAL COMPUTING & APPLICATIONS
- S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization
- (2012) Seyedali Mirjalili et al. Swarm and Evolutionary Computation
- A discrete particle swarm optimization method for feature selection in binary classification problems
- (2010) Alper Unler et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A comparison of feature selection models utilizing binary particle swarm optimization and genetic algorithm in determining coronary artery disease using support vector machine
- (2009) İsmail Babaoglu et al. EXPERT SYSTEMS WITH APPLICATIONS
- Development of a hybrid methodology for dimensionality reduction in Mahalanobis–Taguchi system using Mahalanobis distance and binary particle swarm optimization
- (2009) Avishek Pal et al. EXPERT SYSTEMS WITH APPLICATIONS
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now