Comparative Analysis of Transfer Function-based Binary Metaheuristic Algorithms for Feature Selection

In many real-world problems such as gene selection which is a high dimensional problem, the large number of features is the main challenge. Exhaustive search to find the optimal feature subset is not feasible in a reasonable time and might reduce the performance of the classifier. To address this issue, many binary metaheuristic algorithms are proposed to approximate the optimal solution by removing irrelevant features within an acceptable computational time. This paper presents a comparative analysis to evaluate the efficiency of transfer function-based binary metaheuristic algorithms for feature selection. We compare the performance of popular algorithms Binary Bat Algorithm (BBA), Binary Gravitational Search Algorithm (BGSA) and binary Grey Wolf Optimization (bGWO) with different transfer functions. The experimental results on seven well-known datasets including high dimensional datasets Colon and Leukemia demonstrate that BGSA is an efficient and suitable algorithm for feature selection from both kinds of datasets with low and high dimensions.

[1]  Xin-She Yang,et al.  A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.

[2]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[3]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[4]  Andries Petrus Engelbrecht,et al.  Binary Differential Evolution , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[5]  Andries Petrus Engelbrecht,et al.  Binary differential evolution strategies , 2007, 2007 IEEE Congress on Evolutionary Computation.

[6]  Hossein Nezamabadi-pour,et al.  GSA: A Gravitational Search Algorithm , 2009, Inf. Sci..

[7]  Andrew Lewis,et al.  Grey Wolf Optimizer , 2014, Adv. Eng. Softw..

[8]  Andrew Lewis,et al.  S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization , 2013, Swarm Evol. Comput..

[9]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[10]  N. Franken,et al.  Combining particle swarm optimisation with angle modulation to solve binary problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[11]  Zexuan Zhu,et al.  Markov blanket-embedded genetic algorithm for gene selection , 2007, Pattern Recognit..

[12]  Xin-She Yang,et al.  Binary Bat Algorithm for Feature Selection , 2013 .

[13]  Tom V. Mathew.  Genetic Algorithm , 2022 .

[14]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[15]  Xin-She Yang,et al.  Binary bat algorithm , 2013, Neural Computing and Applications.

[16]  Aboul Ella Hassanien,et al.  Binary grey wolf optimization approaches for feature selection , 2016, Neurocomputing.

[17]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[18]  Hossein Nezamabadi-pour,et al.  BGSA: binary gravitational search algorithm , 2010, Natural Computing.

[19]  Crina Grosan,et al.  Feature Subset Selection Approach by Gray-Wolf Optimization , 2014, AECIA.

[20]  Hu Peng,et al.  Novel Binary Encoding Differential Evolution Algorithm , 2011, ICSI.

[21]  Amer Draa,et al.  Binary Bat Algorithm: On The Efficiency of Mapping Functions When Handling Binary Problems Using Continuous-variable-based Metaheuristics , 2015, CIIA.

[22]  Hoda Zamani,et al.  Swarm Intelligence Approach for Breast Cancer Diagnosis , 2016 .