{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T14:28:01Z","timestamp":1782224881438,"version":"3.54.5"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T00:00:00Z","timestamp":1721692800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T00:00:00Z","timestamp":1721692800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Jilin Provincial Department of science and technology of China","award":["20220201024GX"],"award-info":[{"award-number":["20220201024GX"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s00500-024-09876-9","type":"journal-article","created":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T15:07:22Z","timestamp":1721747242000},"page":"11147-11161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Modified salp swarm algorithm based on competition mechanism and variable shifted windows for feature selection"],"prefix":"10.1007","volume":"28","author":[{"given":"Hongbo","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2859-941X","authenticated-orcid":false,"given":"Xiwen","family":"Qin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xueliang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siqi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunsheng","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,23]]},"reference":[{"issue":"10","key":"9876_CR1","doi-asserted-by":"crossref","first-page":"11675","DOI":"10.1007\/s10462-023-10446-y","volume":"56","author":"M Abdel-Basset","year":"2023","unstructured":"Abdel-Basset M, Mohamed R, Jameel M et al (2023) Spider wasp optimizer: a novel meta-heuristic optimization algorithm. Artif Intell Rev 56(10):11675\u201311738","journal-title":"Artif Intell Rev"},{"key":"9876_CR2","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.116368","volume":"192","author":"L Abualigah","year":"2022","unstructured":"Abualigah L, Diabat A (2022) Chaotic binary group search optimizer for feature selection. Expert Syst Appl 192:116368","journal-title":"Expert Syst Appl"},{"key":"9876_CR3","doi-asserted-by":"crossref","first-page":"11195","DOI":"10.1007\/s00521-019-04629-4","volume":"32","author":"L Abualigah","year":"2020","unstructured":"Abualigah L, Shehab M, Alshinwan M et al (2020) Salp swarm algorithm: a comprehensive survey. Neural Comput Appl 32:11195\u201311215","journal-title":"Neural Comput Appl"},{"key":"9876_CR4","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106628","volume":"147","author":"I Aljarah","year":"2020","unstructured":"Aljarah I, Habib M, Faris H et al (2020) A dynamic locality multi-objective salp swarm algorithm for feature selection. Comput Ind Eng 147:106628","journal-title":"Comput Ind Eng"},{"issue":"21","key":"9876_CR5","doi-asserted-by":"crossref","first-page":"19377","DOI":"10.1007\/s00521-022-07522-9","volume":"34","author":"R Alwajih","year":"2022","unstructured":"Alwajih R, Abdulkadir SJ, Al Hussian H et al (2022) Hybrid binary whale with harris hawks for feature selection. Neural Comput Appl 34(21):19377\u201319395","journal-title":"Neural Comput Appl"},{"key":"9876_CR6","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.107629","volume":"235","author":"M Alweshah","year":"2022","unstructured":"Alweshah M, Alkhalaileh S, Al-Betar MA et al (2022) Coronavirus herd immunity optimizer with greedy crossover for feature selection in medical diagnosis. Knowl-Based Syst 235:107629","journal-title":"Knowl-Based Syst"},{"issue":"11","key":"9876_CR7","doi-asserted-by":"crossref","first-page":"12399","DOI":"10.1007\/s11227-021-03773-w","volume":"77","author":"K Balakrishnan","year":"2021","unstructured":"Balakrishnan K, Dhanalakshmi R, Khaire UM (2021) Improved salp swarm algorithm based on the levy flight for feature selection. J Supercomput 77(11):12399\u201312419","journal-title":"J Supercomput"},{"issue":"18","key":"9876_CR8","doi-asserted-by":"crossref","first-page":"21265","DOI":"10.1007\/s11227-023-05444-4","volume":"79","author":"M Barhoush","year":"2023","unstructured":"Barhoush M, Abed-alguni BH, Al-qudah NEA (2023) Improved discrete salp swarm algorithm using exploration and exploitation techniques for feature selection in intrusion detection systems. J Supercomput 79(18):21265\u201321309","journal-title":"J Supercomput"},{"issue":"12","key":"9876_CR9","doi-asserted-by":"crossref","first-page":"5670","DOI":"10.3390\/app11125670","volume":"11","author":"S Chamchuen","year":"2021","unstructured":"Chamchuen S, Siritaratiwat A, Fuangfoo P et al (2021) Adaptive salp swarm algorithm as optimal feature selection for power quality disturbance classification. Appl Sci 11(12):5670","journal-title":"Appl Sci"},{"key":"9876_CR10","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.eswa.2019.03.039","volume":"128","author":"K Chen","year":"2019","unstructured":"Chen K, Zhou FY, Yuan XF (2019) Hybrid particle swarm optimization with spiral-shaped mechanism for feature selection. Expert Syst Appl 128:140\u2013156","journal-title":"Expert Syst Appl"},{"issue":"3","key":"9876_CR11","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/j.ejor.2005.07.023","volume":"173","author":"SF Crone","year":"2006","unstructured":"Crone SF, Lessmann S, Stahlbock R (2006) The impact of preprocessing on data mining: an evaluation of classifier sensitivity in direct marketing. Eur J Oper Res 173(3):781\u2013800","journal-title":"Eur J Oper Res"},{"key":"9876_CR12","volume":"146","author":"BA\u015e Emine","year":"2020","unstructured":"Emine BA\u015e, \u00dclker E (2020) An efficient binary social spider algorithm for feature selection problem. Expert Syst Appl 146:113185","journal-title":"Expert Syst Appl"},{"key":"9876_CR13","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.105190","volume":"191","author":"A Faramarzi","year":"2020","unstructured":"Faramarzi A, Heidarinejad M, Stephens B et al (2020) Equilibrium optimizer: a novel optimization algorithm. Knowl-Based Syst 191:105190","journal-title":"Knowl-Based Syst"},{"key":"9876_CR14","doi-asserted-by":"crossref","first-page":"112898","DOI":"10.1016\/j.eswa.2019.112898","volume":"140","author":"H Faris","year":"2012","unstructured":"Faris H, Heidari AA, Alam AZ et al (2012) Time-varying hierarchical chains of salps with random weight networks for feature selection. Exp Syst Applicat 140:112898","journal-title":"Exp Syst Applicat"},{"key":"9876_CR15","unstructured":"Frank A (2010) UCI machine learning repository. htt:\/\/archive.uci. edu\/ml"},{"key":"9876_CR16","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Molina D, Lozano M et al (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005 special session on real parameter optimization. J Heur 15:617\u2013644","journal-title":"J Heur"},{"key":"9876_CR17","doi-asserted-by":"crossref","first-page":"3801","DOI":"10.1007\/s13369-018-3680-6","volume":"44","author":"AE Hegazy","year":"2019","unstructured":"Hegazy AE, Makhlouf MA, El-Tawel GS (2019) Feature selection using chaotic salp swarm algorithm for data classification. Arab J Sci Eng 44:3801\u20133816","journal-title":"Arab J Sci Eng"},{"key":"9876_CR18","first-page":"1942","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization[C]\/\/Proceedings of ICNN\u201995-international conference on neural networks. IEEE 4:1942\u20131948","journal-title":"IEEE"},{"issue":"1","key":"9876_CR19","doi-asserted-by":"crossref","first-page":"9377","DOI":"10.1038\/s41598-020-65927-9","volume":"10","author":"K Koras","year":"2020","unstructured":"Koras K, Juraeva D, Kreis J et al (2020) Feature selection strategies for drug sensitivity prediction. Sci Rep 10(1):9377","journal-title":"Sci Rep"},{"key":"9876_CR20","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.future.2020.03.055","volume":"111","author":"S Li","year":"2020","unstructured":"Li S, Chen H, Wang M et al (2020) Slime mould algorithm: a new method for stochastic optimization. Futur Gener Comput Syst 111:300\u2013323","journal-title":"Futur Gener Comput Syst"},{"issue":"17","key":"9876_CR21","doi-asserted-by":"crossref","first-page":"18754","DOI":"10.1007\/s11227-022-04606-0","volume":"78","author":"Y Li","year":"2022","unstructured":"Li Y, Cui X, Fan J et al (2022) Global chaotic bat algorithm for feature selection. J Supercomput 78(17):18754\u201318776","journal-title":"J Supercomput"},{"issue":"23","key":"9876_CR22","doi-asserted-by":"crossref","first-page":"17887","DOI":"10.1007\/s00500-023-09070-3","volume":"27","author":"J Li","year":"2023","unstructured":"Li J, Ren H, Chen H et al (2023) Teaching\u2013learning guided salp swarm algorithm for global optimization tasks and feature selection. Soft Comput 27(23):17887\u201317908","journal-title":"Soft Comput"},{"issue":"5","key":"9876_CR23","volume":"17","author":"W Liu","year":"2022","unstructured":"Liu W, Guo Z, Jiang F et al (2022) Improved WOA and its application in feature selection. PLoS ONE 17(5):e0267041","journal-title":"PLoS ONE"},{"key":"9876_CR24","unstructured":"Liu H, Motoda H (2012) Feature selection for knowledge discovery and data mining[M]. Springer Science and Business Media, Vol. 454"},{"key":"9876_CR25","doi-asserted-by":"crossref","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","journal-title":"Adv Eng Softw"},{"key":"9876_CR26","doi-asserted-by":"crossref","first-page":"9805","DOI":"10.1007\/s00521-021-05745-w","volume":"33","author":"RMA Mohammad","year":"2021","unstructured":"Mohammad RMA, Alsmadi MK (2021) Intrusion detection using Highest Wins feature selection algorithm. Neural Comput Appl 33:9805\u20139816","journal-title":"Neural Comput Appl"},{"key":"9876_CR27","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.113103","volume":"145","author":"N Neggaz","year":"2020","unstructured":"Neggaz N, Ewees AA, Abd Elaziz M et al (2020) Boosting salp swarm algorithm by sine cosine algorithm and disrupt operator for feature selection. Expert Syst Appl 145:113103","journal-title":"Expert Syst Appl"},{"issue":"4","key":"9876_CR28","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1080\/03772063.2020.1725663","volume":"68","author":"KK Patro","year":"2022","unstructured":"Patro KK, Jaya Prakash A, Jayamanmadha Rao M et al (2022) An efficient optimized feature selection with machine learning approach for ECG biometric recognition. IETE J Res 68(4):2743\u20132754","journal-title":"IETE J Res"},{"issue":"6062","key":"9876_CR29","doi-asserted-by":"crossref","first-page":"1518","DOI":"10.1126\/science.1205438","volume":"334","author":"DN Reshef","year":"2011","unstructured":"Reshef DN, Reshef YA, Finucane HK et al (2011) Detecting novel associations in large data sets. Science 334(6062):1518\u20131524","journal-title":"Science"},{"key":"9876_CR30","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117486","volume":"204","author":"B Samieiyan","year":"2022","unstructured":"Samieiyan B, MohammadiNasab P, Mollaei MA et al (2022) Novel optimized crow search algorithm for feature selection. Expert Syst Appl 204:117486","journal-title":"Expert Syst Appl"},{"issue":"5","key":"9876_CR31","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1109\/TEVC.2020.2968743","volume":"24","author":"XF Song","year":"2020","unstructured":"Song XF, Zhang Y, Guo YN et al (2020) Variable-size cooperative coevolutionary particle swarm optimization for feature selection on high-dimensional data. IEEE Trans Evol Comput 24(5):882\u2013895","journal-title":"IEEE Trans Evol Comput"},{"key":"9876_CR32","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2020.107804","volume":"112","author":"X Song","year":"2021","unstructured":"Song X, Zhang Y, Gong D et al (2021) Feature selection using bare-bones particle swarm optimization with mutual information. Pattern Recogn 112:107804","journal-title":"Pattern Recogn"},{"issue":"3","key":"9876_CR33","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1109\/TEVC.2022.3175226","volume":"27","author":"X Song","year":"2022","unstructured":"Song X, Zhang Y, Gong D, Liu H, Zhang W (2022) Surrogate sample-assisted particle swarm optimization for feature selection on high-dimensional data. IEEE Trans Evol Comput 27(3):595\u2013609","journal-title":"IEEE Trans Evol Comput"},{"key":"9876_CR34","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.113122","volume":"145","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 145:113122","journal-title":"Expert Syst Appl"},{"key":"9876_CR35","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113873","volume":"164","author":"M Tubishat","year":"2021","unstructured":"Tubishat M, Ja\u2019afar S, Alswaitti M et al (2021) Dynamic salp swarm algorithm for feature selection. Expert Syst Appl 164:113873","journal-title":"Expert Syst Appl"},{"issue":"20","key":"9876_CR36","doi-asserted-by":"crossref","first-page":"4699","DOI":"10.1016\/j.ins.2011.03.016","volume":"181","author":"H Wang","year":"2011","unstructured":"Wang H, Wu Z, Rahnamayan S et al (2011) Enhancing particle swarm optimization using generalized opposition-based learning. Inf Sci 181(20):4699\u20134714","journal-title":"Inf Sci"},{"key":"9876_CR37","volume":"140","author":"P Wang","year":"2023","unstructured":"Wang P, Xue B, Liang J et al (2023) Feature clustering-Assisted feature selection with differential evolution. Pattern Recogn 140:109523","journal-title":"Pattern Recogn"},{"key":"9876_CR38","first-page":"6","volume":"1","author":"F Wilcoxon","year":"1944","unstructured":"Wilcoxon F (1944) Individual comparisons by ranking methods. Biometrics 1:6","journal-title":"Biometrics"},{"issue":"4","key":"9876_CR39","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1109\/TEVC.2015.2504420","volume":"20","author":"B Xue","year":"2015","unstructured":"Xue B, Zhang M, Browne WN et al (2015) A survey on evolutionary computation approaches to feature selection. IEEE Trans Evol Comput 20(4):606\u2013626","journal-title":"IEEE Trans Evol Comput"},{"key":"9876_CR40","first-page":"65","volume":"2010","author":"XSA Yang","year":"2010","unstructured":"Yang XSA (2010) A new metaheuristic bat-inspired algorithm[M]\/\/Nature inspired cooperative strategies for optimization (NICSO 2010). Berl Heid Spr Berl Heid 2010:65\u201374","journal-title":"Berl Heid Spr Berl Heid"},{"key":"9876_CR41","doi-asserted-by":"crossref","unstructured":"Yang X S (2012) Flower pollination algorithm for global optimization[C]\/\/International conference on unconventional computing and natural computation. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012: 240\u2013249","DOI":"10.1007\/978-3-642-32894-7_27"},{"key":"9876_CR42","doi-asserted-by":"crossref","unstructured":"Yin H, Gai K (2015) An empirical study on preprocessing high-dimensional class-imbalanced data for classification[C]\/\/2015 IEEE 17th international conference on high performance computing and communications, 2015 IEEE 7th international symposium on cyberspace safety and security, and 2015 IEEE 12th international conference on embedded software and systems. IEEE 1314-1319","DOI":"10.1109\/HPCC-CSS-ICESS.2015.205"},{"key":"9876_CR43","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/j.matcom.2023.12.037","volume":"219","author":"H Zhang","year":"2024","unstructured":"Zhang H, Qin X, Gao X et al (2024) Improved salp swarm algorithm based on Newton interpolation and cosine opposition-based learning for feature selection. Math Comput Simul 219:544\u2013558","journal-title":"Math Comput Simul"},{"key":"9876_CR44","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1011219601502","volume":"16","author":"N Zhong","year":"2001","unstructured":"Zhong N, Dong J, Ohsuga S (2001) Using rough sets with heuristics for feature selection. J Intell Informat Syst 16:199\u2013214","journal-title":"J Intell Informat Syst"},{"issue":"5","key":"9876_CR45","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.3390\/s22051711","volume":"22","author":"M Zivkovic","year":"2022","unstructured":"Zivkovic M, Stoean C, Chhabra A et al (2022) Novel improved salp swarm algorithm: an application for feature selection. Sensors 22(5):1711","journal-title":"Sensors"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09876-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-024-09876-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09876-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T07:07:21Z","timestamp":1729321641000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-024-09876-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,23]]},"references-count":45,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["9876"],"URL":"https:\/\/doi.org\/10.1007\/s00500-024-09876-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,23]]},"assertion":[{"value":"16 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2024","order":2,"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 that we have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}