{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T18:11:35Z","timestamp":1770142295389,"version":"3.49.0"},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T00:00:00Z","timestamp":1679443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T00:00:00Z","timestamp":1679443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007102","name":"Zagazig University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007102","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The technological revolution has made available a large amount of data with many irrelevant and noisy features that alter the analysis process and increase time processing. Therefore, feature selection (FS) approaches are used to select the smallest subset of relevant features. Feature selection is viewed as an optimization process for which meta-heuristics have been successfully applied. Thus, in this paper, a new feature selection approach is proposed based on an enhanced version of the Capuchin search algorithm (CapSA). In the developed FS approach, named ECapSA, three modifications have been introduced to avoid a lack of diversity, and premature convergence of the basic CapSA: (1) The inertia weight is adjusted using the logistic map, (2) sine cosine acceleration coefficients are added to improve convergence, and (3) a stochastic learning strategy is used to add more diversity to the movement of Capuchin and a levy random walk. To demonstrate the performance of ECapSA, different datasets are used, and it is compared with other well-known FS methods. The results provide evidence of the superiority of ECapSA among the tested datasets and competitive methods in terms of performance metrics.<\/jats:p>","DOI":"10.1007\/s00521-023-08400-8","type":"journal-article","created":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T15:11:13Z","timestamp":1679497873000},"page":"14061-14080","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Boosting capuchin search with stochastic learning strategy for feature selection"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7682-6269","authenticated-orcid":false,"given":"Mohamed","family":"Abd Elaziz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salima","family":"Ouadfel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rehab Ali","family":"Ibrahim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,22]]},"reference":[{"key":"8400_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.knosys.2015.04.015","volume":"85","author":"A Ekbal","year":"2015","unstructured":"Ekbal A, Saha S (2015) Joint model for feature selection and parameter optimization coupled with classifier ensemble in chemical mention recognition. Knowl-Based Syst 85:37\u201351. https:\/\/doi.org\/10.1016\/j.knosys.2015.04.015","journal-title":"Knowl-Based Syst"},{"key":"8400_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100663","author":"BH Nguyen","year":"2020","unstructured":"Nguyen BH, Xue B, Zhang M (2020) A survey on swarm intelligence approaches to feature selection in data mining. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2020.100663","journal-title":"Swarm Evol Comput"},{"key":"8400_CR3","doi-asserted-by":"crossref","unstructured":"Bai X, Gao X, Xue B (2018) Particle swarm optimization based two-stage feature selection in text mining. In: 2018 IEEE congress on evolutionary computation, CEC 2018\u2014proceedings, pp 1\u20138","DOI":"10.1109\/CEC.2018.8477773"},{"key":"8400_CR4","doi-asserted-by":"crossref","unstructured":"Awada W, Khoshgoftaar TM, Dittman D, et al (2012) A review of the stability of feature selection techniques for bioinformatics data. In: Proceedings of the 2012 IEEE 13th international conference on information reuse and integration, IRI 2012, pp 356\u2013363","DOI":"10.1109\/IRI.2012.6303031"},{"key":"8400_CR5","doi-asserted-by":"publisher","DOI":"10.1080\/23311916.2019.1599537","author":"S Jain","year":"2019","unstructured":"Jain S, Salau AO (2019) An image feature selection approach for dimensionality reduction based on kNN and SVM for AkT proteins. Cogent Eng. https:\/\/doi.org\/10.1080\/23311916.2019.1599537","journal-title":"Cogent Eng"},{"key":"8400_CR6","doi-asserted-by":"crossref","unstructured":"Li L, Abd-El-Atty B, El-Latif AA, Ghoneim A (2017) Quantum color image encryption based on multiple discrete chaotic systems, pp 555\u2013559","DOI":"10.15439\/2017F163"},{"key":"8400_CR7","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1007\/s11042-012-1278-7","volume":"71","author":"N Wang","year":"2014","unstructured":"Wang N, Li Q, Abd El-Latif AA et al (2014) Toward accurate localization and high recognition performance for noisy iris images. Multimed Tools Appl 71:1411\u20131430. https:\/\/doi.org\/10.1007\/s11042-012-1278-7","journal-title":"Multimed Tools Appl"},{"key":"8400_CR8","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.future.2018.06.020","volume":"89","author":"R Gad","year":"2018","unstructured":"Gad R, Talha M, El-Latif AAA et al (2018) Iris recognition using multi-algorithmic approaches for cognitive internet of things (CIoT) framework. Futur Gener Comput Syst 89:178\u2013191. https:\/\/doi.org\/10.1016\/j.future.2018.06.020","journal-title":"Futur Gener Comput Syst"},{"key":"8400_CR9","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1109\/T-C.1971.223410","volume":"c-20","author":"AW Whitney","year":"1971","unstructured":"Whitney AW (1971) A direct method of nonparametric measurement selection. IEEE Trans Comput c\u201320:1100\u20131103. https:\/\/doi.org\/10.1109\/T-C.1971.223410","journal-title":"IEEE Trans Comput"},{"key":"8400_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TIT.1963.1057810","volume":"9","author":"T Marill","year":"1963","unstructured":"Marill T, Green DM (1963) On the effectiveness of receptors in recognition systems. IEEE Trans Inf Theory 9:11\u201317. https:\/\/doi.org\/10.1109\/TIT.1963.1057810","journal-title":"IEEE Trans Inf Theory"},{"key":"8400_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1025667309714","volume":"53","author":"M Robnik-\u0160ikonja","year":"2003","unstructured":"Robnik-\u0160ikonja M, Kononenko I (2003) Theoretical and empirical analysis of relieff and rrelieff. Mach Learn 53:23\u201369. https:\/\/doi.org\/10.1023\/A:1025667309714","journal-title":"Mach Learn"},{"key":"8400_CR12","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00521-013-1368-0","volume":"24","author":"JR Vergara","year":"2014","unstructured":"Vergara JR, Est\u00e9vez PA (2014) A review of feature selection methods based on mutual information. Neural Comput Appl 24:175\u2013186","journal-title":"Neural Comput Appl"},{"key":"8400_CR13","doi-asserted-by":"crossref","unstructured":"Loughrey J, Cunningham P (2007) Overfitting in wrapper-based feature subset selection: the harder you try the worse it gets. In: Research and development in intelligent systems XXI, pp 33\u201343","DOI":"10.1007\/1-84628-102-4_3"},{"key":"8400_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.jksuci.2018.02.013","volume":"33","author":"R Dash","year":"2021","unstructured":"Dash R (2021) An adaptive harmony search approach for gene selection and classification of high dimensional medical data. J King Saud Univ Comput Inf Sci 33:195\u2013207. https:\/\/doi.org\/10.1016\/j.jksuci.2018.02.013","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"8400_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2020.113609","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Diabat A, Mirjalili S et al (2021) The arithmetic optimization algorithm. Comput Methods Appl Mech Eng. https:\/\/doi.org\/10.1016\/j.cma.2020.113609","journal-title":"Comput Methods Appl Mech Eng"},{"key":"8400_CR16","doi-asserted-by":"publisher","first-page":"68","DOI":"10.3390\/computation9060068","volume":"9","author":"ZM Elgamal","year":"2021","unstructured":"Elgamal ZM, Yasin NM, Sabri AQM et al (2021) Improved equilibrium optimization algorithm using elite opposition-based learning and new local search strategy for feature selection in medical datasets. Computation 9:68. https:\/\/doi.org\/10.3390\/computation9060068","journal-title":"Computation"},{"key":"8400_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116158","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Elaziz MA, Sumari P et al (2021) Reptile search algorithm (RSA): a nature-inspired meta-heuristic optimizer. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2021.116158","journal-title":"Expert Syst Appl"},{"key":"8400_CR18","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00521-017-2988-6","volume":"31","author":"GI Sayed","year":"2019","unstructured":"Sayed GI, Hassanien AE, Azar AT (2019) Feature selection via a novel chaotic crow search algorithm. Neural Comput Appl 31:171\u2013188. https:\/\/doi.org\/10.1007\/s00521-017-2988-6","journal-title":"Neural Comput Appl"},{"key":"8400_CR19","first-page":"899","volume":"5","author":"O Babatunde","year":"2014","unstructured":"Babatunde O, Armstrong L, Leng J, Diepeveen D (2014) A genetic algorithm-based feature selection. Int J Electron Commun Comput Eng 5:899\u2013905","journal-title":"Int J Electron Commun Comput Eng"},{"key":"8400_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107250","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Yousri D, AbdElaziz M et al (2021) Aquila optimizer: a novel meta-heuristic optimization algorithm. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2021.107250","journal-title":"Comput Ind Eng"},{"key":"8400_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67\u201382. https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans Evol Comput"},{"key":"8400_CR22","doi-asserted-by":"publisher","first-page":"2515","DOI":"10.1007\/s00521-020-05145-6","volume":"33","author":"M Braik","year":"2021","unstructured":"Braik M, Sheta A, Al-Hiary H (2021) A novel meta-heuristic search algorithm for solving optimization problems: capuchin search algorithm. Neural Comput Appl 33:2515\u20132547. https:\/\/doi.org\/10.1007\/s00521-020-05145-6","journal-title":"Neural Comput Appl"},{"key":"8400_CR23","doi-asserted-by":"publisher","first-page":"2873","DOI":"10.1007\/s11063-021-10530-w","volume":"53","author":"M Braik","year":"2021","unstructured":"Braik M (2021) A hybrid multi-gene genetic programming with capuchin search algorithm for modeling a nonlinear challenge problem: modeling industrial winding process, case study. Neural Process Lett 53:2873\u20132916. https:\/\/doi.org\/10.1007\/s11063-021-10530-w","journal-title":"Neural Process Lett"},{"key":"8400_CR24","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/860289","author":"MA Arasomwan","year":"2013","unstructured":"Arasomwan MA, Adewumi AO (2013) On the performance of linear decreasing inertia weight particle swarm optimization for global optimization. Sci World J. https:\/\/doi.org\/10.1155\/2013\/860289","journal-title":"Sci World J"},{"key":"8400_CR25","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0020-0190(02)00447-7","volume":"85","author":"IC Trelea","year":"2003","unstructured":"Trelea IC (2003) The particle swarm optimization algorithm: convergence analysis and parameter selection. Inf Process Lett 85:317\u2013325. https:\/\/doi.org\/10.1016\/S0020-0190(02)00447-7","journal-title":"Inf Process Lett"},{"key":"8400_CR26","doi-asserted-by":"crossref","unstructured":"Zhang Y, Wang S, Ji G (2015) A comprehensive survey on particle swarm optimization algorithm and its applications. Math Probl Eng 2015","DOI":"10.1155\/2015\/931256"},{"key":"8400_CR27","unstructured":"Tang Z, Zhang D (2009) A modified particle swarm optimization with an adaptive acceleration coefficients. In: Proceedings\u20142009 Asia-pacific conference on information processing, APCIP 2009, pp 330\u2013332"},{"key":"8400_CR28","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.enconman.2016.09.085","volume":"129","author":"AR Jordehi","year":"2016","unstructured":"Jordehi AR (2016) Time varying acceleration coefficients particle swarm optimisation (TVACPSO): a new optimisation algorithm for estimating parameters of PV cells and modules. Energy Convers Manag 129:262\u2013274. https:\/\/doi.org\/10.1016\/j.enconman.2016.09.085","journal-title":"Energy Convers Manag"},{"key":"8400_CR29","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/TEVC.2004.826071","volume":"8","author":"A Ratnaweera","year":"2004","unstructured":"Ratnaweera A, Halgamuge SK, Watson HC (2004) Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans Evol Comput 8:240\u2013255. https:\/\/doi.org\/10.1109\/TEVC.2004.826071","journal-title":"IEEE Trans Evol Comput"},{"key":"8400_CR30","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/TEVC.2005.857610","volume":"10","author":"JJ Liang","year":"2006","unstructured":"Liang JJ, Qin AK, Suganthan PN, Baskar S (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evol Comput 10:281\u2013295. https:\/\/doi.org\/10.1109\/TEVC.2005.857610","journal-title":"IEEE Trans Evol Comput"},{"key":"8400_CR31","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.ins.2012.04.028","volume":"209","author":"M Nasir","year":"2012","unstructured":"Nasir M, Das S, Maity D et al (2012) A dynamic neighborhood learning based particle swarm optimizer for global numerical optimization. Inf Sci (Ny) 209:16\u201336. https:\/\/doi.org\/10.1016\/j.ins.2012.04.028","journal-title":"Inf Sci (Ny)"},{"key":"8400_CR32","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.eswa.2016.06.004","volume":"62","author":"E ZorarpacI","year":"2016","unstructured":"ZorarpacI E, \u00d6zel SA (2016) A hybrid approach of differential evolution and artificial bee colony for feature selection. Expert Syst Appl 62:91\u2013103. https:\/\/doi.org\/10.1016\/j.eswa.2016.06.004","journal-title":"Expert Syst Appl"},{"key":"8400_CR33","doi-asserted-by":"crossref","unstructured":"Nakamura RYM, Pereira LAM, Rodrigues D, et al (2013) Binary bat algorithm for feature selection. In: Swarm intelligence and bio-inspired computation, pp 225\u2013237","DOI":"10.1016\/B978-0-12-405163-8.00009-0"},{"key":"8400_CR34","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.asoc.2016.01.044","volume":"43","author":"P Moradi","year":"2016","unstructured":"Moradi P, Gholampour M (2016) A hybrid particle swarm optimization for feature subset selection by integrating a novel local search strategy. Appl Soft Comput J 43:117\u2013130. https:\/\/doi.org\/10.1016\/j.asoc.2016.01.044","journal-title":"Appl Soft Comput J"},{"key":"8400_CR35","doi-asserted-by":"crossref","unstructured":"Mafarja M, Sabar NR (2018) Rank based binary particle swarm optimisation for feature selection in classification. In: ACM international conference proceeding series","DOI":"10.1145\/3231053.3231072"},{"key":"8400_CR36","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.neucom.2015.06.083","volume":"172","author":"E Emary","year":"2016","unstructured":"Emary E, Zawbaa HM, Hassanien AE (2016) Binary grey wolf optimization approaches for feature selection. Neurocomputing 172:371\u2013381. https:\/\/doi.org\/10.1016\/j.neucom.2015.06.083","journal-title":"Neurocomputing"},{"key":"8400_CR37","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.eswa.2017.07.043","volume":"90","author":"M AbdElaziz","year":"2017","unstructured":"AbdElaziz M, Oliva D, Xiong S (2017) An improved opposition-based sine cosine algorithm for global optimization. Expert Syst Appl 90:484\u2013500. https:\/\/doi.org\/10.1016\/j.eswa.2017.07.043","journal-title":"Expert Syst Appl"},{"key":"8400_CR38","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.asoc.2017.03.002","volume":"56","author":"E Pashaei","year":"2017","unstructured":"Pashaei E, Aydin N (2017) Binary black hole algorithm for feature selection and classification on biological data. Appl Soft Comput 56:94\u2013106. https:\/\/doi.org\/10.1016\/j.asoc.2017.03.002","journal-title":"Appl Soft Comput"},{"key":"8400_CR39","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s11047-019-09769-z","volume":"20","author":"L Kumar","year":"2021","unstructured":"Kumar L, Bharti KK (2021) A novel hybrid BPSO\u2013SCA approach for feature selection. Nat Comput 20:39\u201361. https:\/\/doi.org\/10.1007\/s11047-019-09769-z","journal-title":"Nat Comput"},{"key":"8400_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-021-03254-y","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Dulaimi AJ (2021) A novel feature selection method for data mining tasks using hybrid Sine Cosine Algorithm and Genetic Algorithm. Cluster Comput. https:\/\/doi.org\/10.1007\/s10586-021-03254-y","journal-title":"Cluster Comput"},{"key":"8400_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.09.018","author":"B Xue","year":"2014","unstructured":"Xue B, Zhang M, Browne WN (2014) Particle swarm optimisation for feature selection in classification: novel initialisation and updating mechanisms. Appl Soft Comput J. https:\/\/doi.org\/10.1016\/j.asoc.2013.09.018","journal-title":"Appl Soft Comput J"},{"key":"8400_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2385-6","author":"S Gu","year":"2018","unstructured":"Gu S, Cheng R, Jin Y (2018) Feature selection for high-dimensional classification using a competitive swarm optimizer. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-016-2385-6","journal-title":"Soft Comput"},{"key":"8400_CR43","doi-asserted-by":"crossref","unstructured":"Kaya Y (2018) Feature selection using binary cuckoo search algorithm [Ikili guguk ku\u015fu arama algoritmasi ile \u00f6znitelik se\u00e7imi]. In: 26th IEEE signal process commun appl conf SIU 2018","DOI":"10.1109\/SIU.2018.8404843"},{"key":"8400_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1261-8","author":"GI Sayed","year":"2019","unstructured":"Sayed GI, Tharwat A, Hassanien AE (2019) Chaotic dragonfly algorithm: an improved metaheuristic algorithm for feature selection. Appl Intell. https:\/\/doi.org\/10.1007\/s10489-018-1261-8","journal-title":"Appl Intell"},{"key":"8400_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113572","author":"S Ouadfel","year":"2020","unstructured":"Ouadfel S, AbdElaziz M (2020) Enhanced crow search algorithm for feature selection. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2020.113572","journal-title":"Expert Syst Appl"},{"key":"8400_CR46","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2919991","author":"H Jia","year":"2019","unstructured":"Jia H, Li J, Song W et al (2019) Spotted hyena optimization algorithm with simulated annealing for feature selection. IEEE Access. https:\/\/doi.org\/10.1109\/ACCESS.2019.2919991","journal-title":"IEEE Access"},{"key":"8400_CR47","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2991543","author":"KK Ghosh","year":"2020","unstructured":"Ghosh KK, Ahmed S, Singh PK et al (2020) Improved binary sailfish optimizer based on adaptive \u03b2-Hill climbing for feature selection. IEEE Access. https:\/\/doi.org\/10.1109\/ACCESS.2020.2991543","journal-title":"IEEE Access"},{"key":"8400_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106131","author":"AI Hammouri","year":"2020","unstructured":"Hammouri AI, Mafarja M, Al-Betar MA et al (2020) An improved dragonfly algorithm for feature selection. Knowledge-Based Syst. https:\/\/doi.org\/10.1016\/j.knosys.2020.106131","journal-title":"Knowledge-Based Syst"},{"key":"8400_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-020-01028-5","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Liu R, Wang X et al (2021) Boosted binary Harris hawks optimizer and feature selection. Eng Comput. https:\/\/doi.org\/10.1007\/s00366-020-01028-5","journal-title":"Eng Comput"},{"key":"8400_CR50","doi-asserted-by":"publisher","DOI":"10.3390\/electronics8101130","author":"J Too","year":"2019","unstructured":"Too J, Abdullah AR, Saad NM (2019) A new quadratic binary harris hawk optimization for feature selection. Electron. https:\/\/doi.org\/10.3390\/electronics8101130","journal-title":"Electron"},{"key":"8400_CR51","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-020-01202-7","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Alsalibi B, Shehab M et al (2021) A parallel hybrid krill herd algorithm for feature selection. Int J Mach Learn Cybern. https:\/\/doi.org\/10.1007\/s13042-020-01202-7","journal-title":"Int J Mach Learn Cybern"},{"key":"8400_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104079","author":"Z Sadeghian","year":"2021","unstructured":"Sadeghian Z, Akbari E, Nematzadeh H (2021) A hybrid feature selection method based on information theory and binary butterfly optimization algorithm. Eng Appl Artif Intell. https:\/\/doi.org\/10.1016\/j.engappai.2020.104079","journal-title":"Eng Appl Artif Intell"},{"key":"8400_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.113122","author":"M Tubishat","year":"2020","unstructured":"Tubishat M, Idris N, Shuib L et al (2020) Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2019.113122","journal-title":"Expert Syst Appl"},{"key":"8400_CR54","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.knosys.2018.05.009","volume":"154","author":"H Faris","year":"2018","unstructured":"Faris H, Mafarja MM, Heidari AA et al (2018) An efficient binary Salp Swarm Algorithm with crossover scheme for feature selection problems. Knowl-Based Syst 154:43\u201367. https:\/\/doi.org\/10.1016\/j.knosys.2018.05.009","journal-title":"Knowl-Based Syst"},{"key":"8400_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-2837-7","author":"R Sindhu","year":"2017","unstructured":"Sindhu R, Ngadiran R, Yacob YM et al (2017) Sine\u2013cosine algorithm for feature selection with elitism strategy and new updating mechanism. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-017-2837-7","journal-title":"Neural Comput Appl"},{"key":"8400_CR56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13826-8_5","author":"D Rodrigues","year":"2015","unstructured":"Rodrigues D, Yang XS, De Souza AN, Papa JP (2015) Binary flower pollination algorithm and its application to feature selection. Stud Comput Intell. https:\/\/doi.org\/10.1007\/978-3-319-13826-8_5","journal-title":"Stud Comput Intell"},{"key":"8400_CR57","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2018.11.010","author":"C Yan","year":"2019","unstructured":"Yan C, Ma J, Luo H, Patel A (2019) Hybrid binary coral reefs optimization algorithm with simulated annealing for feature selection in high-dimensional biomedical datasets. Chemom Intell Lab Syst. https:\/\/doi.org\/10.1016\/j.chemolab.2018.11.010","journal-title":"Chemom Intell Lab Syst"},{"key":"8400_CR58","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1997) Discrete binary version of the particle swarm algorithm. In: Proceedings of the IEEE international conference on systems, man and cybernetics, pp 4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"8400_CR59","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.enconman.2011.12.004","volume":"56","author":"B Mohammadi-Ivatloo","year":"2012","unstructured":"Mohammadi-Ivatloo B, Rabiee A, Ehsan M (2012) Time-varying acceleration coefficients IPSO for solving dynamic economic dispatch with non-smooth cost function. Energy Convers Manag 56:175\u2013183. https:\/\/doi.org\/10.1016\/j.enconman.2011.12.004","journal-title":"Energy Convers Manag"},{"key":"8400_CR60","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.ijepes.2009.01.010","volume":"31","author":"KT Chaturvedi","year":"2009","unstructured":"Chaturvedi KT, Pandit M, Srivastava L (2009) Particle swarm optimization with time varying acceleration coefficients for non-convex economic power dispatch. Int J Electr Power Energy Syst 31:249\u2013257. https:\/\/doi.org\/10.1016\/j.ijepes.2009.01.010","journal-title":"Int J Electr Power Energy Syst"},{"key":"8400_CR61","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.ins.2017.09.015","volume":"422","author":"K Chen","year":"2018","unstructured":"Chen K, Zhou F, Yin L et al (2018) A hybrid particle swarm optimizer with sine cosine acceleration coefficients. Inf Sci (Ny) 422:218\u2013241. https:\/\/doi.org\/10.1016\/j.ins.2017.09.015","journal-title":"Inf Sci (Ny)"},{"key":"8400_CR62","doi-asserted-by":"crossref","unstructured":"Yang XS (2010) A new metaheuristic Bat-inspired Algorithm. In: Studies IN COMPUTATIONAL INTELLIGENCE, pp 65\u201374","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"8400_CR63","doi-asserted-by":"crossref","unstructured":"Shi Y, Eberhart R (1998) Modified particle swarm optimizer. In: Proceedings of the IEEE conference on evolutionary computation, ICEC, pp 69\u201373","DOI":"10.1109\/ICEC.1998.699146"},{"key":"8400_CR64","unstructured":"Eberhart RC, Shi Y (2000) Comparing inertia weights and constriction factors in particle swarm optimization. In: Proceedings of the 2000 congress on evolutionary computation, CEC 2000, pp 84\u201388"},{"key":"8400_CR65","doi-asserted-by":"crossref","unstructured":"Liao W, Wang J, Wang J (2011) Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization. In: Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics), pp 80\u201385","DOI":"10.1007\/978-3-642-21515-5_10"},{"key":"8400_CR66","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.12928\/TELKOMNIKA.v12i4.535","volume":"12","author":"K Lei","year":"2014","unstructured":"Lei K, Pu C (2014) Complex optimization problems using highly efficient particle swarm optimizer. TELKOMNIKA 12:1023\u20131030. https:\/\/doi.org\/10.12928\/TELKOMNIKA.v12i4.535","journal-title":"TELKOMNIKA"},{"key":"8400_CR67","doi-asserted-by":"crossref","unstructured":"Feng Y, Teng GF, Wang AX, Yao YM (2007) Chaotic inertia weight in particle swarm optimization. In: 2nd international conference on innovative computing, information and control, ICICIC 2007","DOI":"10.1109\/ICICIC.2007.209"},{"key":"8400_CR68","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/j.asoc.2018.11.033","volume":"75","author":"E Emary","year":"2019","unstructured":"Emary E, Zawbaa HM, Sharawi M (2019) Impact of L\u00e8vy flight on modern meta-heuristic optimizers. Appl Soft Comput J 75:775\u2013789. https:\/\/doi.org\/10.1016\/j.asoc.2018.11.033","journal-title":"Appl Soft Comput J"},{"key":"8400_CR69","doi-asserted-by":"publisher","first-page":"6168","DOI":"10.1109\/ACCESS.2017.2695498","volume":"5","author":"Y Ling","year":"2017","unstructured":"Ling Y, Zhou Y, Luo Q (2017) L\u00e9vy flight trajectory-based whale optimization algorithm for global optimization. IEEE Access 5:6168\u20136186. https:\/\/doi.org\/10.1109\/ACCESS.2017.2695498","journal-title":"IEEE Access"},{"key":"8400_CR70","doi-asserted-by":"crossref","unstructured":"Li N, Li G, Deng Z (2017) An improved sine cosine algorithm based on levy flight. In: 9th international conference on digital image processing (ICDIP 2017), p 104204R","DOI":"10.1117\/12.2282076"},{"key":"8400_CR71","unstructured":"Asuncion A, Newman DJ (2007) UCI machine learning repository: data sets. In: Univ. Calif. Irvine Sch. Inf. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html%5Cnhttp:\/\/archive.ics.uci.edu\/ml\/datasets.html"},{"key":"8400_CR72","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341\u2013359. https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J Glob Optim"},{"key":"8400_CR73","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.advengsoft.2017.07.002","volume":"114","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili S, Gandomi AH, Mirjalili SZ et al (2017) Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163\u2013191. https:\/\/doi.org\/10.1016\/j.advengsoft.2017.07.002","journal-title":"Adv Eng Softw"},{"key":"8400_CR74","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowl-Based Syst 96:120\u2013133. https:\/\/doi.org\/10.1016\/j.knosys.2015.12.022","journal-title":"Knowl-Based Syst"},{"key":"8400_CR75","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s00521-015-1920-1","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput Appl 27:1053\u20131073. https:\/\/doi.org\/10.1007\/s00521-015-1920-1","journal-title":"Neural Comput Appl"},{"key":"8400_CR76","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.asoc.2017.11.006","volume":"62","author":"M Mafarja","year":"2018","unstructured":"Mafarja M, Mirjalili S (2018) Whale optimization approaches for wrapper feature selection. Appl Soft Comput J 62:441\u2013453. https:\/\/doi.org\/10.1016\/j.asoc.2017.11.006","journal-title":"Appl Soft Comput J"},{"key":"8400_CR77","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1080\/08839514.2020.1712788","volume":"34","author":"S Arora","year":"2020","unstructured":"Arora S, Sharma M, Anand P (2020) A novel chaotic interior search algorithm for global optimization and feature selection. Appl Artif Intell 34:292\u2013328. https:\/\/doi.org\/10.1080\/08839514.2020.1712788","journal-title":"Appl Artif Intell"},{"key":"8400_CR78","doi-asserted-by":"publisher","first-page":"26343","DOI":"10.1109\/ACCESS.2019.2897325","volume":"7","author":"S Arora","year":"2019","unstructured":"Arora S, Singh H, Sharma M et al (2019) A new hybrid algorithm based on grey wolf optimization and crow search algorithm for unconstrained function optimization and feature selection. IEEE Access 7:26343\u201326361. https:\/\/doi.org\/10.1109\/ACCESS.2019.2897325","journal-title":"IEEE Access"},{"key":"8400_CR79","doi-asserted-by":"publisher","first-page":"697","DOI":"10.33889\/IJMEMS.2020.5.4.056","volume":"5","author":"OS Qasim","year":"2020","unstructured":"Qasim OS, Algamal ZY (2020) Feature selection using different transfer functions for binary bat algorithm. Int J Math Eng Manag Sci 5:697\u2013706. https:\/\/doi.org\/10.33889\/IJMEMS.2020.5.4.056","journal-title":"Int J Math Eng Manag Sci"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08400-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-08400-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08400-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T18:09:36Z","timestamp":1684951776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-08400-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,22]]},"references-count":79,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["8400"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-08400-8","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,22]]},"assertion":[{"value":"8 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}