In this paper, a new hybrid binary version of Genetic algorithm (GA) and enhanced particle swarm optimization (PSO) algorithm is presented in order to solve feature selection (FS) problem. The proposed algorithm is called Hybrid Binary Genetic Enhanced PSO Algorithm (HBGEPSO). In the proposed HBGEPSO algorithm, the GA is combined with its capacity for exploration of the data through crossover and mutation and enhanced version of the PSO with its ability to converge to the best global solution in the search space. In order to investigate the general performance of the proposed HBGEPSO algorithm, the proposed algorithm is compared with the original optimizers and other optimizers that have been used for FS in the past. A set of assessment indicators are used to evaluate and compare the different optimizers over 20 standard data sets obtained from the UCI repository. Results prove the ability of the proposed HBGEPSO algorithm to search the feature space for optimal feature combinations.
AgrafiotisD.K. and CedenoW., Feature selection for structure-activity correlation using binary particle swarms, Journal of Medicinal Chemistry45(5) (2002), 1098–1107.
2.
AliA.F and TawhidM.A., Hybrid bat algorithm and direct search methods for solving minimax problems, International Journal of Hybrid Intelligent Systems14(4) (2018), 209–223.
3.
AliA.F and TawhidM.A., Hybrid particle swarm optimization with a modified arithmetical crossover for solving unconstrained optimization problems, INFOR: Information Systems and Operational Research53(3) (2015), 125–141.
4.
BanatiH. and BajajM., Fire fly based feature selection approach, IJCSI International Journal of Computer Science Issues8(4) (2011), 473–480.
5.
BellD.A. and WangH., A formalism for relevance and its application in feature subset selection, Machine Earning41(2) (2000), 175–195.
6.
ChandrashekarG. and SahinF., A survey on feature selection methods, Computers & Electrical Engineering40(1) (2014), 16–28.
7.
ChiziB.RokachL. and MaimonO., A survey of feature selection techniques. Encyclopedia of Data Warehousing and Mining, seconded, IGI Global, 2009, pp. 1888–1895.
8.
ChuangL.Y.ChangH.W.TuC.J. and YangC.H., Improved binary PSO for feature selection using gene expression data, Comput Biol Chem32 (2008), 29–38.
9.
CoathG. and HalgamugeS.K., A comparison of constraint-handling methods for the application of particle swarm optimization to constrained nonlinear optimization problems, Proceedings of IEEE Congress on Evolutionary Computation 2003 (CEC 2003), Canbella, Australia, 2003, pp. 2419–2425.
10.
Coello CoelloC.A.LunaE.H. and AguirreA.H., Use of particle swarm optimization to design combinational logic circuits, Lecture Notes in Computer Science (LNCS), No. 2606, 2003, pp. 398–409.
11.
CottaC., A study of hybridisation techniques and their application to the design of evolutionary algorithms, AI Communications11(3–4) (1998), 223–224.
12.
EberhartR.C. and KennedyJ., A new optimizer using particle swarm theory, Proceedings of the Sixth International Symposium on Micromachine and Human Science, Nagoya, Japan, 1995, pp. 39–43.
13.
DasA.K. and PratiharD.K., Performance improvement of a genetic algorithm using a novel restart strategy with elitism principle, International Journal of Hybrid Intelligent Systems (2018), 1–15.
14.
De JongK.A, Genetic algorithms: A 10 year perspective, In International Conference on Genetic Algorithms, 1985, pp. 169–177.
15.
EberhartR.C. and KennedyJ., A new optimizer using particle swarm theory, Proceedings of the Sixth International Symposium on Micromachine and Human Science, Nagoya, Japan. 1995, pp. 39–43.
16.
EmaryE.ZawbaaH.M.GrosanC. and HassanienA.E., Binary grey wolf optimization approaches for feature selection, Neurocomputing172 (2016), 371–381.
17.
FrankA. and AsuncionA., UCI Machine Learning Repository [http://archive.ics.uci.edu/ml]. Irvine, CA: University of School of Information and Computer Science, 2010.
18.
GoldbergD.E., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989.
19.
HollandJ.H., Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.
20.
HuangJ.CaiY. and XuX., A hybrid genetic algorithm for feature selection wrapper based on mutual information, Pattern Recognition Letters28(13) (2007), 1825–1844.
21.
KayaM., The effects of two new crossover operators on genetic algorithm performance, Applied Soft Computing11(1) (2011), 881–890.
22.
EberhartR.C.ShiY. and KennedyJ., Swarm Intelligence (The Morgan Kaufmann Series in Evolutionary Computation), 2001.
23.
KhalidS., A survey of feature selection and feature extraction techniques in machine learning,Science and Information Conference (SAI), 2014.
24.
KrohlingR.A.KnidelH. and ShiY., Solving numerical equations of hydraulic problems using particle swarm optimization, Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2002), Honolulu, Hawaii USA, 2002.
25.
ManK.F.TangK. and KwongS., Genetic algorithms: concepts and applications (in engineering design), IEEE Transactions on Industrial Electronics43(5) (1996), 519–534.
26.
MirjaliliS. and LewisA., S-shaped versus V-shaped transfer functions for binary particle swarm optimization, Swarm and Evolutionary Computation9 (2013), 1–14.
27.
NakamuraR.Y.PereiraL.A.CostaK.A.RodriguesD.PapaJ.P. and YangX.S, BBA: a binary bat algorithm for feature selection. In 2012 25th SIBGRAPI Conference on Graphics, Patterns and Images, IEEE, 2012, pp. 291–297.
28.
GuQ.LiZ. and HanJ., Generalized fisher score for feature selection, In Proc. of the 27th Conference on Uncertainty in Artificial Intelligence (UAI), Barcelona, Spain, 2012, arXiv preprint arXiv:12023725.
29.
TalbiE.G., A taxonomy of hybrid metaheuristics, Journal of Heuristics8(5) (2002), 541–565.
30.
TawhidM.A. and AliA.F., A Hybrid grey wolf optimizer and genetic algorithm for minimizing potential energy function, Memetic Computing9(4) (2017), 347–59.
31.
TawhidM.A. and AliA.F., A hybrid social spider optimization and genetic algorithm for minimizing molecular potential energy function, Soft Computing21(21) (2017), 6499–514.
32.
TawhidM.A. and AliA.F., A simplex grey wolf optimizer for solving integer programming and minimax problems, Numerical Algebra, Control & Optimization7(3) (2017), 301–23.
33.
TawhidM.A. and AliA.F., Direct search firefly algorithm for solving global optimization problems, Applied Mathematics & Information Sciences10(3) (2016), 841–860.
34.
TawhidM.A. and DsouzaK.B., Hybrid binary bat enhanced particle swarm optimization algorithm for solving feature selection problems, Applied Computing and Informatics (2018 Apr 11). https://doi.org/10.1016/j.aci.2018.04.001
35.
TawhidM.A. and DsouzaK.B., Hybrid binary dragonfly enhanced particle swarm optimization algorithm for solving feature selection problems, Mathematical Foundations of Computing1(2) (2018), 181–200.
36.
XueB.ZhangM.BrowneW.N. and YaoX., A Survey on Evolutionary Computation Approaches to Feature Selection, IEEE Transaction on Evolutionary Computation20(4) (2015), 606–626.
37.
WolpertD.H. and MacreadyW.G., No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation1(1) (1997), 67–82.
