A hybrid binary dwarf mongoose optimization algorithm with simulated annealing for feature selection on high dimensional multi-class datasets

被引:45
作者
Akinola, Olatunji A. [1 ]
Ezugwu, Absalom E. [1 ]
Oyelade, Olaide N. [1 ]
Agushaka, Jeffrey O. [1 ]
机构
[1] Univ KwaZulu Natal, Sch Math Stat & Comp Sci, King Edward Ave,Pietermaritzburg Campus, ZA-3201 Pietermaritzburg, Kwazulu Natal, South Africa
基金
英国科研创新办公室;
关键词
PARTICLE SWARM OPTIMIZATION; ARTIFICIAL BEE COLONY; GENETIC ALGORITHMS; SEARCH ALGORITHM; CLASSIFICATION; HARMONY; METAHEURISTICS;
D O I
10.1038/s41598-022-18993-0
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
The dwarf mongoose optimization (DMO) algorithm developed in 2022 was applied to solve continuous mechanical engineering design problems with a considerable balance of the exploration and exploitation phases as a metaheuristic approach. Still, the DMO is restricted in its exploitation phase, somewhat hindering the algorithm's optimal performance. In this paper, we proposed a new hybrid method called the BDMSAO, which combines the binary variants of the DMO (or BDMO) and simulated annealing (SA) algorithm. In the modelling and implementation of the hybrid BDMSAO algorithm, the BDMO is employed and used as the global search method and the simulated annealing (SA) as the local search component to enhance the limited exploitative mechanism of the BDMO. The new hybrid algorithm was evaluated using eighteen (18) UCI machine learning datasets of low and medium dimensions. The BDMSAO was also tested using three high-dimensional medical datasets to assess its robustness. The results showed the efficacy of the BDMSAO in solving challenging feature selection problems on varying datasets dimensions and its outperformance over ten other methods in the study. Specifically, the BDMSAO achieved an overall result of 61.11% in producing the highest classification accuracy possible and getting 100% accuracy on 9 of 18 datasets. It also yielded the maximum accuracy obtainable on the three high-dimensional datasets utilized while achieving competitive performance regarding the number of features selected.
引用
收藏
页数:22
相关论文
共 84 条
[1]   Metaheuristic Algorithms on Feature Selection: A Survey of One Decade of Research (2009-2019) [J].
Agrawal, Prachi ;
Abutarboush, Hattan F. ;
Ganesh, Talari ;
Mohamed, Ali Wagdy .
IEEE ACCESS, 2021, 9 :26766-26791
[2]   Dwarf Mongoose Optimization Algorithm [J].
Agushaka, Jeffrey O. ;
Ezugwu, Absalom E. ;
Abualigah, Laith .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2022, 391
[3]   Advanced arithmetic optimization algorithm for solving mechanical engineering design problems [J].
Agushaka, Jeffrey O. ;
Ezugwu, Absalom E. .
PLOS ONE, 2021, 16 (08)
[4]   Binary Simulated Normal Distribution Optimizer for feature selection: Theory and application in COVID-19 datasets [J].
Ahmed, Shameem ;
Sheikh, Khalid Hassan ;
Mirjalili, Seyedali ;
Sarkar, Ram .
EXPERT SYSTEMS WITH APPLICATIONS, 2022, 200
[5]   A Survey on Hybrid Feature Selection Methods in Microarray Gene Expression Data for Cancer Classification [J].
Almugren, Nada ;
Alshamlan, Hala .
IEEE ACCESS, 2019, 7 :78533-78548
[6]  
[Anonymous], 2009, Metaheuristics: From Design to Implementation
[7]  
[Anonymous], 1998, HDB COMBINATORIAL OP, DOI 10.1007/978-1-4613-0303-9_33
[8]  
Azmi Reza, 2010, 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems (ICIS 2010), P384, DOI 10.1109/ICICISYS.2010.5658728
[9]  
Babatunde RS., 2014, INT J APPL INF SYST, V7, P1
[10]   A Novel Hybrid ACO-GA Algorithm for Text Feature Selection [J].
Basiri, Mohammad Ehsan ;
Nemati, Shahla .
2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, :2561-+