Chaotic binary reptile search algorithm and its feature selection applications

被引:14
作者
Abualigah L. [1 ,2 ,5 ,6 ]
Diabat A. [3 ,4 ]
机构
[1] Hourani Center for Applied Scientific Research, Al-Ahliyya Amman University, Amman
[2] Faculty of Information Technology, Middle East University, Amman
[3] Division of Engineering, New York University Abu Dhabi, Saadiyat Island, Abu Dhabi
[4] Department of Civil and Urban Engineering, Tandon School of Engineering, New York University, Brooklyn, 11201, NY
[5] Faculty of Computer Sciences and Informatics, Amman Arab University, Amman
[6] School of Computer Sciences, Universiti Sains Malaysia, Pulau Pinang
关键词
Binary optimization problem; Chaotic maps; Feature selection (FS); Meta-heuristic algorithm; Reptile Search Algorithm (RSA);
D O I
10.1007/s12652-022-04103-5
中图分类号
学科分类号
摘要
Feature selection (FS) is known as the most challenging problem in the Machine Learning field. FS can be considered an optimization problem that requires an efficient method to prepare its optimal subset of relative features. This article introduces a new FS method-based wrapper scheme that mixes chaotic maps (CMs) and binary Reptile Search Algorithm (RSA) called CRSA, employed to address various FS problems. In this method, different chaotic maps are included with the main ideas of the RSA algorithm. The objective function is revealed to combine three objectives: maximizing the classification accuracy, the number of chosen features, and the complexity of produced wrapper models. To assess the achievement of the proposed methods, 20 UCI datasets are applied, and the results are compared with other well-known methods. The results showed the superiority of the introduced method in bettering other well-known techniques, particularly when applying binary RSA with Tent CM. © 2022, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.
引用
收藏
页码:13931 / 13947
页数:16
相关论文
共 61 条
[11]  
Alomari O.A., Khader A.T., Al-Betar M.A., Abualigah L.M., Mrmr ba: a hybrid gene selection algorithm for cancer classification, J Theor Appl Inf Technol, 95, pp. 2610-2618, (2017)
[12]  
Arora S., Anand P., Binary butterfly optimization approaches for feature selection, Expert Syst Appl, 116, pp. 147-160, (2019)
[13]  
Arora S., Anand P., Chaotic grasshopper optimization algorithm for global optimization, Neural Comput Appl, 31, pp. 4385-4405, (2019)
[14]  
Arora S., Sharma M., Anand P., A novel chaotic interior search algorithm for global optimization and feature selection, Appl Artif Intell, pp. 1-37, (2020)
[15]  
Chandrashekar G., Sahin F., A survey on feature selection methods, Comput Electr Eng, 40, pp. 16-28, (2014)
[16]  
Chen H., Li T., Fan X., Luo C., Feature selection for imbalanced data based on neighborhood rough sets, Inf Sci, 483, pp. 1-20, (2019)
[17]  
Chen Y.-P., Li Y., Wang G., Zheng Y.-F., Xu Q., Fan J.-H., Cui X.-T., A novel bacterial foraging optimization algorithm for feature selection, Expert Syst Appl, 83, pp. 1-17, (2017)
[18]  
Chuang L.-Y., Yang C.-H., Li J.-C., Chaotic maps based on binary particle swarm optimization for feature selection, Appl Soft Comput, 11, pp. 239-248, (2011)
[19]  
Chuang L.-Y., Yang C.-S., Wu K.-C., Yang C.-H., Gene selection and classification using taguchi chaotic binary particle swarm optimization, Expert Syst Appl, 38, pp. 13367-13377, (2011)
[20]  
Cover T.M., Thomas J.A., Elements of information theory, (2012)