{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:07:20Z","timestamp":1775066840007,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T00:00:00Z","timestamp":1611187200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T00:00:00Z","timestamp":1611187200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61806204"],"award-info":[{"award-number":["61806204"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61663009"],"award-info":[{"award-number":["61663009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61672466"],"award-info":[{"award-number":["61672466"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Joint Fund of Zhejiang Provincial Natural Science Foundation","award":["LSZ19F010001"],"award-info":[{"award-number":["LSZ19F010001"]}]},{"name":"Opening Foundation of Key Lab of Intelligent Optimization and Information Processing, Minnan Normal University","award":["ZNYH202002"],"award-info":[{"award-number":["ZNYH202002"]}]},{"name":"The Science and Technology Plan Projects of Zhangzhou","award":["ZZ2020J06"],"award-info":[{"award-number":["ZZ2020J06"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s00607-020-00891-w","type":"journal-article","created":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T20:02:50Z","timestamp":1611259370000},"page":"1569-1597","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Novel self-adjusted particle swarm optimization algorithm for feature selection"],"prefix":"10.1007","volume":"103","author":[{"given":"Bo","family":"Wei","sequence":"first","affiliation":[]},{"given":"Xuan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xuewen","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Mingfeng","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Zuohua","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Yanrong","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,21]]},"reference":[{"key":"891_CR1","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1016\/j.physa.2015.05.008","volume":"436","author":"P Moradi","year":"2015","unstructured":"Moradi P, Ahmadian S, Akhlaghian F (2015) An effective trust-based recommendation method using a novel graph clustering algorithm. Physica A: Stat Mech Appl 436:462\u2013481","journal-title":"Physica A: Stat Mech Appl"},{"key":"891_CR2","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1016\/j.sigpro.2014.12.012","volume":"120","author":"S Wang","year":"2016","unstructured":"Wang S, Chang X, Li X et al (2016) Multi-task support vector machines for feature selection with shared knowledge discovery. Signal Process 120:746\u2013753","journal-title":"Signal Process"},{"issue":"1","key":"891_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.knosys.2014.10.013","volume":"73","author":"Y Wang","year":"2015","unstructured":"Wang Y, Liu Y, Feng L et al (2015) Novel feature selection method based on harmony search for email classification. Knowl-Based Syst 73(1):311\u2013323","journal-title":"Knowl-Based Syst"},{"issue":"22","key":"891_CR4","first-page":"1","volume":"6","author":"S Sharma","year":"2020","unstructured":"Sharma S, Singh G (2020) Diagnosis of cardiac arrhythmia using Swarm-intelligence based metaheuristic techniques: a comparative analysis. EAI Endors Trans Pervas Health Technol 6(22):1\u201311","journal-title":"EAI Endors Trans Pervas Health Technol"},{"key":"891_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.asoc.2016.01.044","volume":"43","author":"M Parham","year":"2016","unstructured":"Parham M, Mozhgan G (2016) A hybrid particle swarm optimization for feature subset selection by integrating a novel local search strategy. Appl Soft Comput 43:117\u2013130","journal-title":"Appl Soft Comput"},{"issue":"7","key":"891_CR6","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1016\/j.patcog.2008.10.028","volume":"42","author":"H Liu","year":"2009","unstructured":"Liu H, Sun J, Liu L et al (2009) Feature selection with dynamic mutual information. Pattern Recogn 42(7):1330\u20131339","journal-title":"Pattern Recogn"},{"key":"891_CR7","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.neucom.2012.09.049","volume":"148","author":"Y Zhang","year":"2015","unstructured":"Zhang Y, Gong D, Hu Y et al (2015) Feature selection algorithm based on bare bones particle swarm optimization. Neurocomputing 148:150\u2013157","journal-title":"Neurocomputing"},{"key":"891_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.asoc.2016.01.019","volume":"43","author":"KK Bharti","year":"2016","unstructured":"Bharti KK, Singh PK (2016) Opposition chaotic fitness mutation based adaptive inertia weight BPSO for feature selection in text clustering. Appl Soft Comput 43:20\u201334","journal-title":"Appl Soft Comput"},{"issue":"4","key":"891_CR9","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 et al (2016) A survey on evolutionary computation approaches to feature selection. IEEE Trans Evol Comput 20(4):606\u2013626","journal-title":"IEEE Trans Evol Comput"},{"key":"891_CR10","doi-asserted-by":"publisher","first-page":"7725","DOI":"10.1007\/s00521-019-04530-0","volume":"32","author":"S Khalilpourazari","year":"2020","unstructured":"Khalilpourazari S, Pasandideh S (2020) Sine-cosine crow search algorithm: theory and applications. Neural Comput Appl 32:7725\u20137742","journal-title":"Neural Comput Appl"},{"key":"891_CR11","doi-asserted-by":"publisher","first-page":"3037","DOI":"10.1007\/s00500-019-04080-6","volume":"24","author":"S Khalilpourazari","year":"2020","unstructured":"Khalilpourazari S, Naderi B, Khalilpourazary S (2020) Multi-objective stochastic fractal search: a powerful algorithm for solving complex multi-objective optimization problems. Soft Comput 24:3037\u20133066","journal-title":"Soft Comput"},{"key":"891_CR12","doi-asserted-by":"publisher","first-page":"11671","DOI":"10.1007\/s00500-018-03718-1","volume":"23","author":"S Khalilpourazari","year":"2019","unstructured":"Khalilpourazari S, Pasandideh S, Niaki S (2019) Optimizing a multi-item economic order quantity problem with imperfect items, inspection errors, and backorders. Soft Comput 23:11671\u201311698","journal-title":"Soft Comput"},{"issue":"1","key":"891_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.patcog.2009.06.009","volume":"43","author":"IA Gheyas","year":"2010","unstructured":"Gheyas IA, Smith LS (2010) Feature subset selection in large dimensionality domains. Pattern Recogn 43(1):5\u201313","journal-title":"Pattern Recogn"},{"issue":"15","key":"891_CR14","doi-asserted-by":"publisher","first-page":"6676","DOI":"10.1016\/j.eswa.2014.05.009","volume":"41","author":"G Manizheh","year":"2014","unstructured":"Manizheh G, Mohammad-Reza F (2014) Forest optimization algorithm. Expert Syst Appl 41(15):6676\u20136687","journal-title":"Expert Syst Appl"},{"issue":"10","key":"891_CR15","doi-asserted-by":"publisher","first-page":"12699","DOI":"10.1016\/j.eswa.2011.04.057","volume":"38","author":"LY Chuang","year":"2011","unstructured":"Chuang LY, Tsai SW, Yang CH (2011) Improved binary particle swarm optimization using catfish effect for feature selection. Expert Syst Appl 38(10):12699\u201312707","journal-title":"Expert Syst Appl"},{"key":"891_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.asoc.2013.09.018","volume":"18","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 18:261\u2013276","journal-title":"Appl Soft Comput"},{"key":"891_CR17","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1016\/j.neucom.2015.05.022","volume":"168","author":"S Tabakhi","year":"2015","unstructured":"Tabakhi S, Najafi A, Ranjbar R et al (2015) Gene selection for microarray data classification using a novel ant colony optimization. Neurocomputing 168:1024\u20131036","journal-title":"Neurocomputing"},{"issue":"2","key":"891_CR18","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1016\/j.eswa.2007.01.014","volume":"34","author":"SW Lin","year":"2008","unstructured":"Lin SW, Tseng TY, Chou SY et al (2008) A simulated-annealing-based approach for simultaneous parameter optimization and feature selection of back-propagation networks. Expert Syst Appl 34(2):1491\u20131499","journal-title":"Expert Syst Appl"},{"key":"891_CR19","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","journal-title":"Knowl-Based Syst"},{"key":"891_CR20","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","journal-title":"IEEE Access"},{"key":"891_CR21","doi-asserted-by":"publisher","unstructured":"Sharma M, Kaur P (2020) A comprehensive analysis of nature-inspired meta-heuristic techniques for feature selection problem. Arch Comput Methods Eng. https:\/\/doi.org\/10.1007\/s11831-020-09412-6","DOI":"10.1007\/s11831-020-09412-6"},{"key":"891_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2020.100663","volume":"54","author":"B Nguyen","year":"2020","unstructured":"Nguyen B, Xue B, Zhang M (2020) A survey on swarm intelligence approaches to feature selection in data mining. Swarm Evol Comput 54:1. https:\/\/doi.org\/10.1016\/j.swevo.2020.100663","journal-title":"Swarm Evol Comput"},{"key":"891_CR23","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-030-49724-8_15","volume":"18","author":"A Tzanetos","year":"2020","unstructured":"Tzanetos A, Dounias G (2020) A comprehensive survey on the applications of swarm intelligence and bio-inspired evolutionary strategies. Mach Learn Paradigms 18:337\u2013378","journal-title":"Mach Learn Paradigms"},{"issue":"12","key":"891_CR24","first-page":"5069","volume":"5","author":"JF Chang","year":"2009","unstructured":"Chang JF (2009) A performance comparison between genetic algorithms and particle swarm optimization applied in constructing equity portfolios. Int J Innov Comput Inf Control 5(12):5069\u20135079","journal-title":"Int J Innov Comput Inf Control"},{"issue":"7","key":"891_CR25","doi-asserted-by":"publisher","first-page":"10604","DOI":"10.1016\/j.eswa.2009.02.055","volume":"36","author":"Y Marinakis","year":"2009","unstructured":"Marinakis Y, Marinaki M, Doumpos M et al (2009) Ant colony and particle swarm optimization for financial classification problems. Expert Syst Appl 36(7):10604\u201310611","journal-title":"Expert Syst Appl"},{"key":"891_CR26","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s13748-019-00191-1","volume":"8","author":"R Gautam","year":"2019","unstructured":"Gautam R, Kaur P, Sharma M (2019) A comprehensive review on nature inspired computing algorithms for the diagnosis of chronic disorders in human beings. Progress Artif Intell 8:401\u2013424","journal-title":"Progress Artif Intell"},{"key":"891_CR27","doi-asserted-by":"publisher","unstructured":"Chai X (2020) Task scheduling based on swarm intelligence algorithms in high performance computing environment. J Ambient Intell Hum Comput. https:\/\/doi.org\/10.1007\/s12652-020-01994-0","DOI":"10.1007\/s12652-020-01994-0"},{"issue":"3","key":"891_CR28","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s00500-016-2385-6","volume":"22","author":"S Gu","year":"2016","unstructured":"Gu S, Cheng R, Jin Y (2016) Feature selection for high-dimensional classification using a competitive swarm optimizer. Soft Comput 22(3):811\u2013822","journal-title":"Soft Comput"},{"key":"891_CR29","unstructured":"Yu L, Liu H (2003) Feature selection for high-dimensional data: a fast correlation-based filter solution. Presented at the Proceedings of the 20th international conference on machine learning, Washington, USA, Augest 21\u201324"},{"key":"891_CR30","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/B:AMAI.0000018580.96245.c6","volume":"41","author":"LE Raileanu","year":"2004","unstructured":"Raileanu LE, Stoffel K (2004) Theoretical comparison between the Gini index and information gain criteria. Ann Math Artif Intell 41:77\u201393","journal-title":"Ann Math Artif Intell"},{"key":"891_CR31","volume-title":"Pattern recognition","author":"S Theodoridis","year":"2008","unstructured":"Theodoridis S, Koutroumbas K (2008) Pattern recognition. Academic Press, Oxford"},{"key":"891_CR32","unstructured":"He XF, Cai D, Niyogi P (2005) Laplacian score for feature selection. Advances in Neural Information Processing System 18, British Columbia, Canada, pp 507\u2013514"},{"key":"891_CR33","first-page":"80","volume":"321","author":"LL Zhu","year":"2012","unstructured":"Zhu LL, Miao LS, Zhang DQ (2012) Iterative laplacian score for feature selection. Chin Conf Pattern Recognit Commun Comput Inf Sci 321:80\u201387","journal-title":"Chin Conf Pattern Recognit Commun Comput Inf Sci"},{"key":"891_CR34","unstructured":"Gu Q, Li Z, Han J (2011) Generalized fisher score for feature selection. In: Proceedings of the 27th conference on uncertainty in artificial intelligence, Barcelona, Spain, pp 14\u201317"},{"issue":"8","key":"891_CR35","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","volume":"27","author":"H Peng","year":"2005","unstructured":"Peng H, Long F, Ding C (2005) Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy. IEEE Trans Pattern Anal Mach Intell 27(8):1226\u20131238","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"10","key":"891_CR36","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/j.patrec.2005.12.018","volume":"27","author":"C Lai","year":"2006","unstructured":"Lai C, Reinders MJT, Wessels L (2006) Random subspace method for multivariate feature selection. Pattern Recogn Lett 27(10):1067\u20131076","journal-title":"Pattern Recogn Lett"},{"key":"891_CR37","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.knosys.2015.04.007","volume":"84","author":"P Moradi","year":"2015","unstructured":"Moradi P, Rostami M (2015) Integration of graph clustering with ant colony optimization for feature selection. Knowl-Based Syst 84:144\u2013161","journal-title":"Knowl-Based Syst"},{"key":"891_CR38","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ins.2017.05.013","volume":"409","author":"J Che","year":"2017","unstructured":"Che J, Yang Y, Li L et al (2017) Maximum relevance minimum common redundancy feature selection for nonlinear data. Inf Sci 409:68\u201386","journal-title":"Inf Sci"},{"key":"891_CR39","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.eswa.2018.05.029","volume":"110","author":"W Gao","year":"2018","unstructured":"Gao W, Hu L, Zhang P et al (2018) Feature selection by integrating two groups of feature evaluation criteria. Expert Syst Appl 110:11\u201319","journal-title":"Expert Syst Appl"},{"issue":"20","key":"891_CR40","doi-asserted-by":"publisher","first-page":"4625","DOI":"10.1016\/j.ins.2010.05.037","volume":"181","author":"A Unler","year":"2011","unstructured":"Unler A, Murat A, Chinnam RB (2011) mr2PSO: a maximum relevance minimum redundancy feature selection method based on swarm intelligence for support vector machine classification. Inf Sci 181(20):4625\u20134641","journal-title":"Inf Sci"},{"issue":"7","key":"891_CR41","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1016\/j.patcog.2005.10.006","volume":"39","author":"Y Liu","year":"2006","unstructured":"Liu Y, Zheng YF (2006) FS-SFS: a novel feature selection method for support vector machines. Pattern Recogn 39(7):1333\u20131345","journal-title":"Pattern Recogn"},{"key":"891_CR42","doi-asserted-by":"crossref","unstructured":"Manikandan G, Susi E, Abirami S (2017) Feature selection on high dimensional data using wrapper based subset selection. In: IEEE 2nd international conference on recent trends and challenges in computational models, Tamilnadu, India, pp 263\u2013268","DOI":"10.1109\/ICRTCCM.2017.58"},{"key":"891_CR43","doi-asserted-by":"publisher","unstructured":"Tawhid MA, Ibrahim AM (2019) Feature selection based on rough set approach, wrapper approach, and binary whale optimization algorithm. Int J Mach Learn Cybern. https:\/\/doi.org\/10.1007\/s13042-019-00996-5","DOI":"10.1007\/s13042-019-00996-5"},{"issue":"5","key":"891_CR44","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0167-8655(89)90037-8","volume":"10","author":"W Siedlecki","year":"1989","unstructured":"Siedlecki W, Sklansky J (1989) A note on genetic algorithms for large-scale feature selection. Pattern Recogn Lett 10(5):335\u2013347","journal-title":"Pattern Recogn Lett"},{"issue":"9","key":"891_CR45","doi-asserted-by":"publisher","first-page":"2798","DOI":"10.1016\/j.patcog.2015.03.020","volume":"48","author":"S Tabakhi","year":"2015","unstructured":"Tabakhi S, Moradi P (2015) RelevanceCredundancy feature selection based on ant colony optimization. Pattern Recogn 48(9):2798\u20132811","journal-title":"Pattern Recogn"},{"key":"891_CR46","first-page":"1","volume":"43","author":"M Schiezaro","year":"2013","unstructured":"Schiezaro M, Pedrini H (2013) Data feature selection based on Artificial Bee Colony algorithm. Eurasip J Image Video Process 43:1\u20138","journal-title":"Eurasip J Image Video Process"},{"issue":"9","key":"891_CR47","doi-asserted-by":"publisher","first-page":"11570","DOI":"10.1016\/j.eswa.2009.03.032","volume":"36","author":"Y Li","year":"2009","unstructured":"Li Y, Zhang S, Zeng X (2009) Research of multi-population agent genetic algorithm for feature selection. Expert Syst Appl 36(9):11570\u201311581","journal-title":"Expert Syst Appl"},{"issue":"2","key":"891_CR48","doi-asserted-by":"publisher","first-page":"2501","DOI":"10.1016\/j.asoc.2010.08.020","volume":"11","author":"TM Hamdani","year":"2011","unstructured":"Hamdani TM, Won JM, Alimi AM et al (2011) Hierarchical genetic algorithm with new evaluation function and bi-coded representation for the selection of features considering their confidence rate. Appl Soft Comput 11(2):2501\u20132509","journal-title":"Appl Soft Comput"},{"issue":"17","key":"891_CR49","doi-asserted-by":"publisher","first-page":"2914","DOI":"10.1016\/j.neucom.2011.03.034","volume":"74","author":"MM Kabir","year":"2011","unstructured":"Kabir MM, Shahjahan M, Murase K (2011) A new local search based hybrid genetic algorithm for feature selection. Neurocomputing 74(17):2914\u20132928","journal-title":"Neurocomputing"},{"key":"891_CR50","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural network, Perth, Western Australia, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"891_CR51","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ins.2018.01.027","volume":"436\u2013437","author":"F Wang","year":"2018","unstructured":"Wang F, Zhang H, Li KS et al (2018) A hybrid particle swarm optimization algorithm using adaptive learning strategy. Inf Sci 436\u2013437:162\u2013177","journal-title":"Inf Sci"},{"key":"891_CR52","doi-asserted-by":"crossref","unstructured":"Jiang J, Bo Y, Song C et al (2012) Hybrid algorithm based on particle swarm optimization and artificial fish swarm algorithm. Presented at the international conference on advances in neural networks, Shenyang, China, pp 607\u2013614","DOI":"10.1007\/978-3-642-31346-2_68"},{"issue":"5","key":"891_CR53","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/3340848","volume":"13","author":"Y Xue","year":"2019","unstructured":"Xue Y, Xue B, Zhang M (2019) Self-adaptive particle swarm optimization for large-scale feature selection in classification. ACM Trans Knowl Discov Data 13(5):50","journal-title":"ACM Trans Knowl Discov Data"},{"key":"891_CR54","doi-asserted-by":"publisher","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"},{"key":"891_CR55","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 43:117\u2013130","journal-title":"Appl Soft Comput"},{"key":"891_CR56","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.eswa.2018.07.013","volume":"113","author":"M Amoozegar","year":"2018","unstructured":"Amoozegar M, Minaei-Bidgoli B (2018) Optimizing multi-objective PSO based feature selection method using a feature elitism mechanism. Expert Syst Appl 113:499\u2013514","journal-title":"Expert Syst Appl"},{"key":"891_CR57","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: Procs of (1997) Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation. IEEE, pp 4104\u20134108"},{"issue":"9","key":"891_CR58","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","volume":"35","author":"QK Pan","year":"2008","unstructured":"Pan QK, Fatih TM, Liang YC (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35(9):2807\u20132839","journal-title":"Comput Oper Res"},{"key":"891_CR59","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.asoc.2015.07.005","volume":"35","author":"Y Lu","year":"2015","unstructured":"Lu Y, Liang M, Ye Z et al (2015) Improved particle swarm optimization algorithm and its application in text feature selection. Appl Soft Comput 35:629\u2013636","journal-title":"Appl Soft Comput"},{"issue":"3","key":"891_CR60","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 et al (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal function. IEEE Trans Evol Comput 10(3):281\u2013295","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"891_CR61","doi-asserted-by":"publisher","first-page":"166066","DOI":"10.1109\/ACCESS.2019.2953298","volume":"7","author":"B Wei","year":"2019","unstructured":"Wei B, Zhang WS, Xia XW et al (2019) Efficient feature selection algorithm based on particle swarm optimization with learning memory. IEEE Access 7(1):166066\u2013166078","journal-title":"IEEE Access"},{"issue":"10","key":"891_CR62","doi-asserted-by":"publisher","first-page":"13367","DOI":"10.1016\/j.eswa.2011.04.165","volume":"38","author":"LY Chuang","year":"2011","unstructured":"Chuang LY, Yang CS, Wu KC et al (2011) Gene selection and classification using Taguchi chaotic binary particle swarm optimization. Expert Syst Appl 38(10):13367\u201313377","journal-title":"Expert Syst Appl"},{"issue":"1","key":"891_CR63","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R Kohavi","year":"1997","unstructured":"Kohavi R, John GH (1997) Wrappers for feature subset selection. Artif Intell 97(1):273\u2013324","journal-title":"Artif Intell"},{"issue":"1","key":"891_CR64","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"B Pfahringer","year":"2009","unstructured":"Pfahringer B, Reutemann P, Witten IH et al (2009) The WEKA data mining software: an update. ACM SIGKDD Explor Newsl 11(1):10\u201318","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"891_CR65","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1007\/s00521-014-1640-y","volume":"25","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Lewis A (2014) Adaptive gbest-guided gravitational search algorithm. Neural Comput Appl 25:1569\u20131584","journal-title":"Neural Comput Appl"},{"issue":"15","key":"891_CR66","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 M, Heidari A et al (2018) An efficient binary salp swarm algorithm with crossover scheme for feature selection problems. Knowl-Based Syst 154(15):43\u201367","journal-title":"Knowl-Based Syst"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-020-00891-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-020-00891-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-020-00891-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T17:07:09Z","timestamp":1626887229000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-020-00891-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,21]]},"references-count":66,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["891"],"URL":"https:\/\/doi.org\/10.1007\/s00607-020-00891-w","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,21]]},"assertion":[{"value":"2 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work, there is no professional or other personal interest of any nature or kind in any product, service and\/or company that could be construed as influencing the position presented in, or the review of, the manuscript entitled.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}