{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T18:04:50Z","timestamp":1785953090189,"version":"3.56.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T00:00:00Z","timestamp":1702339200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T00:00:00Z","timestamp":1702339200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"FCT","award":["IDB\/00408\/2020, UIDP\/00408\/2020,MAR-01.03.01-FEAMP-0047,DSAIPA\/DS\/0113\/2019,2021\/05322\/BD,SFRH\/BD\/143972\/2019"],"award-info":[{"award-number":["IDB\/00408\/2020, UIDP\/00408\/2020,MAR-01.03.01-FEAMP-0047,DSAIPA\/DS\/0113\/2019,2021\/05322\/BD,SFRH\/BD\/143972\/2019"]}]},{"name":"National Library Of Medicine of the National Institutes of Health","award":["R00LM012926"],"award-info":[{"award-number":["R00LM012926"]}]},{"DOI":"10.13039\/501100005765","name":"Universidade de Lisboa","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005765","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present SLUG, a recent method that uses genetic algorithms as a wrapper for genetic programming and performs feature selection while inducing models. SLUG was shown to be successful on different types of classification tasks, achieving state-of-the-art results on the synthetic datasets produced by GAMETES, a tool for embedding epistatic gene\u2013gene interactions into noisy datasets. SLUG has also been studied and modified to demonstrate that its two elements, wrapper and learner, are the right combination that grants it success. We report these results and test SLUG on an additional six GAMETES datasets of increased difficulty, for a total of four regular and 16 epistatic datasets. Despite its slowness, SLUG achieves the best results and solves all but the most difficult classification tasks. We perform further explorations of its inner dynamics and discover how to improve the feature selection by enriching the communication between wrapper and learner, thus taking the first step toward a new and more powerful SLUG.<\/jats:p>","DOI":"10.1007\/s42979-023-02106-3","type":"journal-article","created":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T11:02:32Z","timestamp":1702378952000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Exploring SLUG: Feature Selection Using Genetic Algorithms and Genetic Programming"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5312-8276","authenticated-orcid":false,"given":"Nuno M.","family":"Rodrigues","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jo\u00e3o E.","family":"Batista","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William La","family":"Cava","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leonardo","family":"Vanneschi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sara","family":"Silva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,12]]},"reference":[{"key":"2106_CR1","doi-asserted-by":"publisher","unstructured":"Cordell HJ. Epistasis: what it means, what it doesn\u2019t mean, and statistical methods to detect it in humans. Human Molecular Genetics. 2002;11(20):2463\u20138. https:\/\/doi.org\/10.1093\/hmg\/11.20.2463. http:\/\/academic.oup.com\/hmg\/article-pdf\/11\/20\/2463\/1699507\/ddf251.pdf","DOI":"10.1093\/hmg\/11.20.2463"},{"key":"2106_CR2","doi-asserted-by":"publisher","unstructured":"Davidor Y. Epistasis variance: A viewpoint on ga-hardness. Foundations of Genetic Algorithms, vol. 1, pp. 23\u201335. Elsevier; 1991. https:\/\/doi.org\/10.1016\/B978-0-08-050684-5.50005-7","DOI":"10.1016\/B978-0-08-050684-5.50005-7"},{"key":"2106_CR3","doi-asserted-by":"crossref","unstructured":"Reeves CR, Wright CC. Epistasis in genetic algorithms: An experimental design perspective. In: Proceedings of the 6th International Conference on Genetic Algorithms, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA; 1995. p. 217\u2013224.","DOI":"10.1016\/B978-1-55860-356-1.50005-4"},{"key":"2106_CR4","unstructured":"Altenberg L. B2.7.2. NK fitness landscapes. In: Handbook of Evolutionary Computation, pp. 5\u201310. IOP Publishing Ltd and Oxford University Press, GBR; 1997."},{"key":"2106_CR5","doi-asserted-by":"publisher","unstructured":"Merz P, Freisleben B. On the effectiveness of evolutionary search in high-dimensional nk-landscapes. In: 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360), 1998; p. 741\u2013745. https:\/\/doi.org\/10.1109\/ICEC.1998.700144","DOI":"10.1109\/ICEC.1998.700144"},{"key":"2106_CR6","doi-asserted-by":"publisher","unstructured":"Mathias KE, Eshelman LJ, Schaffer JD. Niches in nk-landscapes. In: Martin, W.N., Spears, W.M. (eds.) Foundations of Genetic Algorithms 6, Morgan Kaufmann, San Francisco; 2001. pp 27\u201346. https:\/\/doi.org\/10.1016\/B978-155860734-7\/50085-8","DOI":"10.1016\/B978-155860734-7\/50085-8"},{"key":"2106_CR7","doi-asserted-by":"publisher","unstructured":"Chan KY, Aydin ME, Fogarty TC. An epistasis measure based on the analysis of variance for the real-coded representation in genetic algorithms. In: The 2003 Congress on Evolutionary Computation, 2003. CEC \u201903., vol. 1, pp. 297\u20133041. 2003. https:\/\/doi.org\/10.1109\/CEC.2003.1299588","DOI":"10.1109\/CEC.2003.1299588"},{"key":"2106_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-36605-9_13","volume-title":"Applications of Evolutionary Computing","author":"HE Aguirre","year":"2003","unstructured":"Aguirre HE, Tanaka K. Genetic algorithms on nk-landscapes: Effects of selection, drift, mutation, and recombination. In: Cagnoni S, Johnson CG, Cardalda JJR, Marchiori E, Corne DW, Meyer J-A, Gottlieb J, Middendorf M, Guillot A, Raidl GR, Hart E, editors. Applications of Evolutionary Computing. Berlin, Heidelberg: Springer; 2003. p. 131\u201342."},{"key":"2106_CR9","doi-asserted-by":"publisher","unstructured":"Pelikan M, Sastry K, Goldberg DE, Butz MV, Hauschild M. Performance of evolutionary algorithms on nk landscapes with nearest neighbor interactions and tunable overlap. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation. GECCO \u201909, Association for Computing Machinery, New York, NY, USA; 2009. p. 851\u2013858. https:\/\/doi.org\/10.1145\/1569901.1570018","DOI":"10.1145\/1569901.1570018"},{"key":"2106_CR10","doi-asserted-by":"publisher","unstructured":"Tin\u00f3s R, Whitley D, Chicano F. Partition crossover for pseudo-boolean optimization. In: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII. FOGA \u201915, Association for Computing Machinery, New York, NY, USA; 2015. p. 137\u2013149. https:\/\/doi.org\/10.1145\/2725494.2725497","DOI":"10.1145\/2725494.2725497"},{"key":"2106_CR11","doi-asserted-by":"publisher","unstructured":"Vanneschi L, Castelli M, Manzoni L. The k landscapes: A tunably difficult benchmark for genetic programming. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation. GECCO \u201911, Association for Computing Machinery, New York, NY, USA; 2011. p. 1467\u20131474. https:\/\/doi.org\/10.1145\/2001576.2001773","DOI":"10.1145\/2001576.2001773"},{"issue":"1","key":"2106_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0020-0255(97)00017-0","volume":"102","author":"S Rochet","year":"1997","unstructured":"Rochet S. Epistasis in genetic algorithms revisited. Inf Sci. 1997;102(1):133\u201355. https:\/\/doi.org\/10.1016\/S0020-0255(97)00017-0.","journal-title":"Inf Sci"},{"key":"2106_CR13","doi-asserted-by":"publisher","unstructured":"Jafari S, Kapitaniak T, Rajagopal K, Pham V-T, Alsaadi F. Effect of epistasis on the performance of genetic algorithms. Journal of Zhejiang University-SCIENCE A. 2018;20. https:\/\/doi.org\/10.1631\/jzus.A1800399","DOI":"10.1631\/jzus.A1800399"},{"key":"2106_CR14","doi-asserted-by":"crossref","first-page":"2095167","DOI":"10.1155\/2019\/2095167","volume":"13","author":"J Lee","year":"2019","unstructured":"Lee J, Kim Y-H. Epistasis-based basis estimation method for simplifying the problem space of an evolutionary search in binary representation. Complexity. 2019;13:2095167.","journal-title":"Complexity"},{"key":"2106_CR15","doi-asserted-by":"publisher","unstructured":"Ansarifar J, Wang L. New algorithms for detecting multi-effect and multi-way epistatic interactions. Bioinformatics. 2019;35(24):5078\u201385. https:\/\/doi.org\/10.1093\/bioinformatics\/btz463. http:\/\/academic.oup.com\/bioinformatics\/article-pdf\/35\/24\/5078\/31797822\/btz463.pdf","DOI":"10.1093\/bioinformatics\/btz463"},{"key":"2106_CR16","doi-asserted-by":"publisher","unstructured":"Mo H, Li Z, Zhu C. A kind of epistasis-tunable test functions for genetic algorithms. Concurrency and Computation: Practice and Experience. 2021;33(8):5030. https:\/\/doi.org\/10.1002\/cpe.5030. e5030 cpe.5030.","DOI":"10.1002\/cpe.5030"},{"key":"2106_CR17","unstructured":"Hall MA. Correlation-based feature selection for machine learning. PhD thesis. 1999."},{"key":"2106_CR18","doi-asserted-by":"publisher","unstructured":"Nazareth DL, Soofi ES, Zhao H. Visualizing attribute interdependencies using mutual information, hierarchical clustering, multidimensional scaling, and self-organizing maps. In: 2007 40th Annual Hawaii International Conference on System Sciences (HICSS\u201907), 2007. p. 53\u201353. https:\/\/doi.org\/10.1109\/HICSS.2007.608","DOI":"10.1109\/HICSS.2007.608"},{"key":"2106_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-90512-9_3","volume-title":"Genetic Programming Theory and Practice XV","author":"MF Korns","year":"2018","unstructured":"Korns MF. Genetic programming symbolic classification: A study. In: Banzhaf W, Olson RS, Tozier W, Riolo R, editors. Genetic Programming Theory and Practice XV. Cham: Springer; 2018. p. 39\u201354."},{"key":"2106_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-1-0716-0947-7_18","volume":"2212","author":"OO Petinrin","year":"2021","unstructured":"Petinrin OO, Wong K-C. Protocol for epistasis detection with machine learning using genepi package. Methods Mol Biol. 2021;2212:291\u2013305.","journal-title":"Methods Mol Biol"},{"key":"2106_CR21","doi-asserted-by":"publisher","unstructured":"Urbanowicz RJ, Kiralis J, Sinnott-Armstrong NA, et al. GAMETES: a fast, direct algorithm for generating pure, strict, epistatic models with random architectures. BioData Mining, 2012;5(16). https:\/\/doi.org\/10.1186\/1756-0381-5-16","DOI":"10.1186\/1756-0381-5-16"},{"key":"2106_CR22","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.swevo.2018.03.015","volume":"44","author":"W La Cava","year":"2019","unstructured":"La Cava W, Silva S, Danai K, Spector L, Vanneschi L, Moore JH. Multidimensional genetic programming for multiclass classification. Swarm Evol Comput. 2019;44:260\u201372. https:\/\/doi.org\/10.1016\/j.swevo.2018.03.015.","journal-title":"Swarm Evol Comput"},{"key":"2106_CR23","doi-asserted-by":"publisher","unstructured":"Sohn A, Olson RS, Moore JH. Toward the automated analysis of complex diseases in genome-wide association studies using genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO \u201917, Association for Computing Machinery, New York, NY, USA; 2017. p. 489\u2013496. https:\/\/doi.org\/10.1145\/3071178.3071212","DOI":"10.1145\/3071178.3071212"},{"key":"2106_CR24","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jbi.2018.07.014","volume":"85","author":"RJ Urbanowicz","year":"2018","unstructured":"Urbanowicz RJ, Meeker M, La Cava W, Olson RS, Moore JH. Relief-based feature selection: Introduction and review. J Biomed Inform. 2018;85:189\u2013203. https:\/\/doi.org\/10.1016\/j.jbi.2018.07.014.","journal-title":"J Biomed Inform"},{"key":"2106_CR25","doi-asserted-by":"publisher","unstructured":"Lanzi PL. Fast feature selection with genetic algorithms: a filter approach. In: Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC \u201997), 1997. p. 537\u2013540. https:\/\/doi.org\/10.1109\/ICEC.1997.592369","DOI":"10.1109\/ICEC.1997.592369"},{"key":"2106_CR26","doi-asserted-by":"publisher","unstructured":"Chaikla N, Qi Y. Genetic algorithms in feature selection. In: IEEE SMC\u201999 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028), vol. 5, pp. 538\u20135405. 1999. https:\/\/doi.org\/10.1109\/ICSMC.1999.815609","DOI":"10.1109\/ICSMC.1999.815609"},{"key":"2106_CR27","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.ins.2020.03.032","volume":"523","author":"A-D Li","year":"2020","unstructured":"Li A-D, Xue B, Zhang M. Multi-objective feature selection using hybridization of a genetic algorithm and direct multisearch for key quality characteristic selection. Inf Sci. 2020;523:245\u201365. https:\/\/doi.org\/10.1016\/j.ins.2020.03.032.","journal-title":"Inf Sci"},{"key":"2106_CR28","doi-asserted-by":"publisher","unstructured":"Hussein F, Kharma N, Ward R. Genetic algorithms for feature selection and weighting, a review and study. In: Proceedings of Sixth International Conference on Document Analysis and Recognition, 2001. p. 1240\u20131244. https:\/\/doi.org\/10.1109\/ICDAR.2001.953980","DOI":"10.1109\/ICDAR.2001.953980"},{"issue":"4","key":"2106_CR29","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1109\/TEVC.2015.2504420","volume":"20","author":"B Xue","year":"2016","unstructured":"Xue B, Zhang M, Browne WN, Yao X. A survey on evolutionary computation approaches to feature selection. IEEE Trans Evol Comput. 2016;20(4):606\u201326. https:\/\/doi.org\/10.1109\/TEVC.2015.2504420.","journal-title":"IEEE Trans Evol Comput"},{"issue":"9","key":"2106_CR30","doi-asserted-by":"publisher","first-page":"2092","DOI":"10.1177\/0003702817713501","volume":"71","author":"BK Lavine","year":"2017","unstructured":"Lavine BK, White CG. Boosting the performance of genetic algorithms for variable selection in partial least squares spectral calibrations. Appl Spectrosc. 2017;71(9):2092\u2013101.","journal-title":"Appl Spectrosc"},{"key":"2106_CR31","doi-asserted-by":"publisher","unstructured":"Chiesa M, Maioli G, Colombo GI, et al. Gars: Genetic algorithm for the identification of a robust subset of features in high-dimensional datasets. BMC Bioinformatics, 2020;21(54). https:\/\/doi.org\/10.1186\/s12859-020-3400-6","DOI":"10.1186\/s12859-020-3400-6"},{"issue":"7","key":"2106_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0219683","volume":"14","author":"B Wutzl","year":"2019","unstructured":"Wutzl B, Leibnitz K, Rattay F, Kronbichler M, Murata M, Golaszewski SM. Genetic algorithms for feature selection when classifying severe chronic disorders of consciousness. PLoS ONE. 2019;14(7):1\u201316. https:\/\/doi.org\/10.1371\/journal.pone.0219683.","journal-title":"PLoS ONE"},{"key":"2106_CR33","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0957-4174(02)00051-9","volume":"23","author":"K-S Shin","year":"2002","unstructured":"Shin K-S, Lee Y-J. A genetic algorithm application in bankruptcy prediction modeling. Expert Syst Appl. 2002;23:321\u20138.","journal-title":"Expert Syst Appl"},{"key":"2106_CR34","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-540-74695-9_55","volume-title":"Artificial Neural Networks - ICANN 2007","author":"K-K Seo","year":"2007","unstructured":"Seo K-K. Content-based image retrieval by combining genetic algorithm and support vector machine. In: de S\u00e1 JM, Alexandre LA, Duch W, Mandic D, editors. Artificial Neural Networks - ICANN 2007. Berlin, Heidelberg: Springer; 2007. p. 537\u201345."},{"issue":"8","key":"2106_CR35","doi-asserted-by":"publisher","first-page":"2446","DOI":"10.1109\/tgrs.2008.922061","volume":"46","author":"C Chion","year":"2008","unstructured":"Chion C, Landry J-A, Costa LD. A genetic-programming-based method for hyperspectral data information extraction: Agricultural applications. IEEE Trans Geosci Remote Sens. 2008;46(8):2446\u201357. https:\/\/doi.org\/10.1109\/tgrs.2008.922061.","journal-title":"IEEE Trans Geosci Remote Sens"},{"key":"2106_CR36","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1155\/2020\/8617430","volume":"8617430","author":"A Garc\u00eda-Dominguez","year":"2020","unstructured":"Garc\u00eda-Dominguez A, Galv\u00e1n-Tejada CE, Zanella-Calzada LA, Gamboa-Rosales H, Galv\u00e1n-Tejada JI, Celaya-Padilla JM, Luna-Garc\u00eda H, Magallanes-Quintanar R. Feature selection using genetic algorithms for the generation of a recognition and classification of children activities model using environmental sound. Mobile Information Systems Article ID. 2020;8617430:12. https:\/\/doi.org\/10.1155\/2020\/8617430.","journal-title":"Mobile Information Systems Article ID"},{"key":"2106_CR37","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz L, Silva S, Trujillo L. M3gp - multiclass classification with gp. In: EuroGP. 2015.","DOI":"10.1007\/978-3-319-16501-1_7"},{"key":"2106_CR38","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-36599-0_21","volume-title":"Genetic Programming","author":"MG Smith","year":"2003","unstructured":"Smith MG, Bull L. Feature construction and selection using genetic programming and a genetic algorithm. In: Ryan C, Soule T, Keijzer M, Tsang E, Poli R, Costa E, editors. Genetic Programming. Berlin, Heidelberg: Springer; 2003. p. 229\u201337."},{"issue":"12","key":"2106_CR39","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1007\/s00500-008-0296-x","volume":"12","author":"WB Langdon","year":"2008","unstructured":"Langdon WB, Harrison AP. GP on SPMD parallel graphics hardware for mega bioinformatics data mining. Soft Comput. 2008;12(12):1169\u201383. https:\/\/doi.org\/10.1007\/s00500-008-0296-x.","journal-title":"Soft Comput"},{"key":"2106_CR40","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10710-011-9151-4","volume":"13","author":"JA Doucette","year":"2012","unstructured":"Doucette JA, McIntyre AR, Lichodzijewski P, Heywood MI. Symbiotic coevolutionary genetic programming: a benchmarking study under large attribute spaces. Genet Program Evolvable Mach. 2012;13:71\u2013101.","journal-title":"Genet Program Evolvable Mach"},{"key":"2106_CR41","doi-asserted-by":"publisher","unstructured":"Rodriguez-Coayahuitl L, Morales-Reyes A, Escalante HJ, Coello Coello CA. Cooperative co-evolutionary GP for high dimensional problems. In: Baeck, T., Preuss, M., Deutz, A., Wang2, H., Doerr, C., Emmerich, M., Trautmann, H. (eds.) 16th International Conference on Parallel Problem Solving from Nature, Part II. LNCS, vol. 12270, Springer, Leiden, Holland; 2020. p. 48\u201362. https:\/\/doi.org\/10.1007\/978-3-030-58115-2_4","DOI":"10.1007\/978-3-030-58115-2_4"},{"key":"2106_CR42","doi-asserted-by":"publisher","unstructured":"Guyon I, Gunn S, Hur AB, Dror G. In: Guyon, I., Nikravesh, M., Gunn, S., Zadeh, L.A. (eds.) Design and Analysis of the NIPS2003 Challenge, Springer, Berlin, Heidelberg; 2006. p. 237\u2013263. https:\/\/doi.org\/10.1007\/978-3-540-35488-8_10","DOI":"10.1007\/978-3-540-35488-8_10"},{"key":"2106_CR43","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-44094-7_10","volume-title":"Genetic Programming","author":"NM Rodrigues","year":"2020","unstructured":"Rodrigues NM, Batista JE, Silva S. Ensemble genetic programming. In: Hu T, Louren\u00e7o N, Medvet E, Divina F, editors. Genetic Programming. Cham: Springer; 2020. p. 151\u201366."},{"issue":"9","key":"2106_CR44","doi-asserted-by":"publisher","first-page":"3298","DOI":"10.1080\/01431161.2022.2089540","volume":"43","author":"JE Batista","year":"2022","unstructured":"Batista JE, Rodrigues NM, Cabral AIR, Vasconcelos MJP, Venturieri A, Silva LGT, Silva S. Optical time series for the separation of land cover types with similar spectral signatures: cocoa agroforest and forest. Int J Remote Sens. 2022;43(9):3298\u2013319. https:\/\/doi.org\/10.1080\/01431161.2022.2089540.","journal-title":"Int J Remote Sens"},{"key":"2106_CR45","doi-asserted-by":"crossref","unstructured":"Pei W, Xue B, Shang L, Zhang M. New fitness functions in genetic programming for classification with high-dimensional unbalanced data. In: 2019 IEEE Congress on Evolutionary Computation (CEC), IEEE; 2019. p. 2779\u20132786.","DOI":"10.1109\/CEC.2019.8789974"},{"issue":"1","key":"2106_CR46","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s12293-015-0173-y","volume":"8","author":"B Tran","year":"2015","unstructured":"Tran B, Xue B, Zhang M. Genetic programming for feature construction and selection in classification on high-dimensional data. Memetic Computing. 2015;8(1):3\u201315. https:\/\/doi.org\/10.1007\/s12293-015-0173-y.","journal-title":"Memetic Computing"},{"key":"2106_CR47","doi-asserted-by":"publisher","unstructured":"Silva S, Tseng Y-T. Classification of seafloor habitats using genetic programming. In: Lecture Notes in Computer Science, Springer; 2008. p. 315\u2013324. https:\/\/doi.org\/10.1007\/978-3-540-78761-7_32","DOI":"10.1007\/978-3-540-78761-7_32"},{"key":"2106_CR48","doi-asserted-by":"publisher","unstructured":"Rodrigues NM, Batista JaE, La\u00a0Cava W, Vanneschi L, Silva S. Slug: Feature selection using genetic algorithms and genetic programming. In: Genetic Programming: 25th European Conference, EuroGP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20\u201322, 2022, Proceedings, Springer, Berlin, Heidelberg; 2022. p. 68\u201384. https:\/\/doi.org\/10.1007\/978-3-031-02056-8_5","DOI":"10.1007\/978-3-031-02056-8_5"},{"key":"2106_CR49","unstructured":"Dua D, Graff C. UCI Machine Learning Repository. 2017. http:\/\/archive.ics.uci.edu\/ml"},{"key":"2106_CR50","unstructured":"Zhang S. sonar.all-data. Kaggle. 2018. https:\/\/www.kaggle.com\/ypzhangsam\/sonaralldata"},{"key":"2106_CR51","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1186\/1756-0381-5-16","volume":"5","author":"RJ Urbanowicz","year":"2012","unstructured":"Urbanowicz RJ, Kiralis J, Sinnott-Armstrong NA, Heberling T, Fisher JM, Moore JH. Gametes: a fast, direct algorithm for generating pure, strict, epistatic models with random architectures. BioData Mining. 2012;5:16\u201316.","journal-title":"BioData Mining"},{"key":"2106_CR52","doi-asserted-by":"crossref","unstructured":"Kononenko I. Estimating attributes: Analysis and extensions of relief. In: ECML. 1994.","DOI":"10.1007\/3-540-57868-4_57"},{"key":"2106_CR53","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V, Vanderplas J, Passos A, Cournapeau D, Brucher M, Perrot M, Duchesnay E. Scikit-learn: Machine learning in Python. J Mach Learn Res. 2011;12:2825\u201330.","journal-title":"J Mach Learn Res"},{"issue":"3","key":"2106_CR54","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1109\/tevc.2018.2869405","volume":"23","author":"B Tran","year":"2019","unstructured":"Tran B, Xue B, Zhang M. Variable-length particle swarm optimization for feature selection on high-dimensional classification. IEEE Trans Evol Comput. 2019;23(3):473\u201387. https:\/\/doi.org\/10.1109\/tevc.2018.2869405.","journal-title":"IEEE Trans Evol Comput"},{"issue":"13","key":"2106_CR55","doi-asserted-by":"publisher","first-page":"3019","DOI":"10.3390\/rs14133019","volume":"14","author":"Y Shang","year":"2022","unstructured":"Shang Y, Zheng X, Li J, Liu D, Wang P. A comparative analysis of swarm intelligence and evolutionary algorithms for feature selection in SVM-based hyperspectral image classification. Remote Sensing. 2022;14(13):3019. https:\/\/doi.org\/10.3390\/rs14133019.","journal-title":"Remote Sensing"},{"key":"2106_CR56","unstructured":"Lehman J, Stanley KO. Exploiting open-endedness to solve problems through the search for novelty. In: Bullock, S., Noble, J., Watson, R.A., Bedau, M.A. (eds.) Proceedings of the Eleventh International Conference on Artificial Life (Alife XI), MIT Press, Cambridge, MA; 2008. p. 329\u2013336."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-023-02106-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-023-02106-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-023-02106-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T20:28:39Z","timestamp":1730838519000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-023-02106-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,12]]},"references-count":56,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["2106"],"URL":"https:\/\/doi.org\/10.1007\/s42979-023-02106-3","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,12]]},"assertion":[{"value":"7 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 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":"The authors declare no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"91"}}