{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T14:36:18Z","timestamp":1781879778937,"version":"3.54.5"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T00:00:00Z","timestamp":1569283200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61403206, 61876089"],"award-info":[{"award-number":["61403206, 61876089"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012246","name":"Priority Academic Program Development of Jiangsu Higher Education Institutions","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012246","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"crossref","award":["BK20141005"],"award-info":[{"award-number":["BK20141005"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of the Jiangsu Higher Education Institutions of China","award":["14KJB520025"],"award-info":[{"award-number":["14KJB520025"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2019,10,31]]},"abstract":"<jats:p>Many evolutionary computation (EC) methods have been used to solve feature selection problems and they perform well on most small-scale feature selection problems. However, as the dimensionality of feature selection problems increases, the solution space increases exponentially. Meanwhile, there are more irrelevant features than relevant features in datasets, which leads to many local optima in the huge solution space. Therefore, the existing EC methods still suffer from the problem of stagnation in local optima on large-scale feature selection problems. Furthermore, large-scale feature selection problems with different datasets may have different properties. Thus, it may be of low performance to solve different large-scale feature selection problems with an existing EC method that has only one candidate solution generation strategy (CSGS). In addition, it is time-consuming to find a suitable EC method and corresponding suitable parameter values for a given large-scale feature selection problem if we want to solve it effectively and efficiently. In this article, we propose a self-adaptive particle swarm optimization (SaPSO) algorithm for feature selection, particularly for large-scale feature selection. First, an encoding scheme for the feature selection problem is employed in the SaPSO. Second, three important issues related to self-adaptive algorithms are investigated. After that, the SaPSO algorithm with a typical self-adaptive mechanism is proposed. The experimental results on 12 datasets show that the solution size obtained by the SaPSO algorithm is smaller than its EC counterparts on all datasets. The SaPSO algorithm performs better than its non-EC and EC counterparts in terms of classification accuracy not only on most training sets but also on most test sets. Furthermore, as the dimensionality of the feature selection problem increases, the advantages of SaPSO become more prominent. This highlights that the SaPSO algorithm is suitable for solving feature selection problems, particularly large-scale feature selection problems.<\/jats:p>","DOI":"10.1145\/3340848","type":"journal-article","created":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T12:57:52Z","timestamp":1569416272000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":326,"title":["Self-Adaptive Particle Swarm Optimization for Large-Scale Feature Selection in Classification"],"prefix":"10.1145","volume":"13","author":[{"given":"Yu","family":"Xue","sequence":"first","affiliation":[{"name":"Nanjing University of Information Science and Technology, Nanjing, Jiangsu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bing","family":"Xue","sequence":"additional","affiliation":[{"name":"Victoria University of Wellington, Kelburn Parade, Wellington, New Zealand"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mengjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"Victoria University of Wellington, Kelburn Parade, Wellington, New Zealand"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,9,24]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-014-1576-8"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2012.09.003"},{"key":"e_1_2_2_3_1","unstructured":"K. Bache and M. Lichman. 2016. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml\/index.php.  K. Bache and M. Lichman. 2016. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml\/index.php."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.01.019"},{"key":"e_1_2_2_5_1","doi-asserted-by":"crossref","unstructured":"X. J. Chang F. P. Nie Y. Yang C. Q. Zhang and H. Huang. 2016. Convex sparse PCA for unsupervised feature learning. ACM Transactions on Knowledge Discovery from Data 11 1 (2016) 16.  X. J. Chang F. P. Nie Y. Yang C. Q. Zhang and H. Huang. 2016. Convex sparse PCA for unsupervised feature learning. ACM Transactions on Knowledge Discovery from Data 11 1 (2016) 16.","DOI":"10.1145\/2910585"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/72.265956"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.12.004"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2009.06.009"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-017-0150-9"},{"key":"e_1_2_2_11_1","volume-title":"Adaptation in Natural and Artificial Systems","author":"Holland J. H.","unstructured":"J. H. Holland . 1975. Adaptation in Natural and Artificial Systems . University of Michigan Press. J. H. Holland. 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2012.53"},{"key":"e_1_2_2_13_1","volume-title":"IEEE International Conference on Neural Networks. 1942--1948","author":"Kennedy J.","unstructured":"J. Kennedy and R. Eberhart . 1995. Particle swarm optimization . In IEEE International Conference on Neural Networks. 1942--1948 . J. Kennedy and R. Eberhart. 1995. Particle swarm optimization. In IEEE International Conference on Neural Networks. 1942--1948."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/892491"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2171946"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2211372"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.857610"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057810"},{"key":"e_1_2_2_19_1","volume-title":"International Conference on Communications. 101--104","author":"Neagoe V. E.","unstructured":"V. E. Neagoe and E. C. Neghina . 2016. Feature selection with ant colony optimization and its applications for pattern recognition in space imagery . In International Conference on Communications. 101--104 . V. E. Neagoe and E. C. Neghina. 2016. Feature selection with ant colony optimization and its applications for pattern recognition in space imagery. In International Conference on Communications. 101--104."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1716-3"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(94)90127-9"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.927706"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90057-I"},{"key":"e_1_2_2_24_1","volume-title":"3rd International Joint Conference on Pattern Recognition. 71--75","author":"Stearns S. D.","year":"1976","unstructured":"S. D. Stearns . 1976 . On selecting features for pattern classifiers . In 3rd International Joint Conference on Pattern Recognition. 71--75 . S. D. Stearns. 1976. On selecting features for pattern classifiers. In 3rd International Joint Conference on Pattern Recognition. 71--75."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2012.2183645"},{"key":"e_1_2_2_27_1","volume-title":"IEEE Congress on Evolutionary Computation. 1505--1512","author":"Sudo T.","unstructured":"T. Sudo , K. Goto , Y. Nojima , and H. Ishibuchi . 2015. Effects of ensemble action selection with different usage of player\u2019s memory resource on the evolution of cooperative strategies for iterated prisoner\u2019s dilemma game . In IEEE Congress on Evolutionary Computation. 1505--1512 . T. Sudo, K. Goto, Y. Nojima, and H. Ishibuchi. 2015. Effects of ensemble action selection with different usage of player\u2019s memory resource on the evolution of cooperative strategies for iterated prisoner\u2019s dilemma game. In IEEE Congress on Evolutionary Computation. 1505--1512."},{"key":"e_1_2_2_28_1","doi-asserted-by":"crossref","unstructured":"J. L. Tang and H. Liu. 2014. Feature selection for social media data. ACM Transactions on Knowledge Discovery from Data 8 4 (2014) 1--27.  J. L. Tang and H. Liu. 2014. Feature selection for social media data. ACM Transactions on Knowledge Discovery from Data 8 4 (2014) 1--27.","DOI":"10.1145\/2629587"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.10.012"},{"key":"e_1_2_2_30_1","first-page":"14231","article-title":"Chaotic self-adaptive particle swarm optimization algorithm for dynamic economic dispatch problem with valve-point effects","volume":"38","author":"Wang Y.","year":"2011","unstructured":"Y. Wang . 2011 . Chaotic self-adaptive particle swarm optimization algorithm for dynamic economic dispatch problem with valve-point effects . Expert Systems with Applications 38 , 11 (2011), 14231 -- 14237 . Y. Wang. 2011. Chaotic self-adaptive particle swarm optimization algorithm for dynamic economic dispatch problem with valve-point effects. Expert Systems with Applications 38, 11 (2011), 14231--14237.","journal-title":"Expert Systems with Applications"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.07.013"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223410"},{"key":"e_1_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Y. Wu S. C. H. Hoi T. Mei and N. H. Yu. 2017. Large-scale online feature selection for ultra-high dimensional sparse data. ACM Transactions on Knowledge Discovery from Data 11 4 (2017) 1--22.  Y. Wu S. C. H. Hoi T. Mei and N. H. Yu. 2017. Large-scale online feature selection for ultra-high dimensional sparse data. ACM Transactions on Knowledge Discovery from Data 11 4 (2017) 1--22.","DOI":"10.1145\/3070646"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2007.1009"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2504420"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2012.2227469"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2841440.2841476"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2547-1"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/2942969.2943068"},{"key":"e_1_2_2_40_1","doi-asserted-by":"crossref","unstructured":"H. Q. Yang M. R. Lyu and I. King. 2013. Efficient online learning for multitask feature selection. ACM Transactions on Knowledge Discovery from Data 7 2 (2013) 1--27.  H. Q. Yang M. R. Lyu and I. King. 2013. Efficient online learning for multitask feature selection. ACM Transactions on Knowledge Discovery from Data 7 2 (2013) 1--27.","DOI":"10.1145\/2499907.2499909"},{"key":"e_1_2_2_41_1","doi-asserted-by":"crossref","unstructured":"J. H. Yang and V. Honavar. 1998. Feature subset selection using a genetic algorithm. IEEE Intelligent Systems and their Applications 13 2 (1998) 44--49.  J. H. Yang and V. Honavar. 1998. Feature subset selection using a genetic algorithm. IEEE Intelligent Systems and their Applications 13 2 (1998) 44--49.","DOI":"10.1109\/5254.671091"},{"key":"e_1_2_2_42_1","volume-title":"Nature-Inspired Metaheuristic Algorithms","author":"Yang X. S.","unstructured":"X. S. Yang . 2008. Nature-Inspired Metaheuristic Algorithms . LuniverPress . X. S. Yang. 2008. Nature-Inspired Metaheuristic Algorithms. LuniverPress."},{"key":"e_1_2_2_43_1","doi-asserted-by":"crossref","unstructured":"K. Yu X. D. Wu W. Ding and J. Pei. 2016. Scalable and accurate online feature selection for big data. ACM Transactions on Knowledge Discovery from Data 11 2 (2016) 39.  K. Yu X. D. Wu W. Ding and J. Pei. 2016. Scalable and accurate online feature selection for big data. ACM Transactions on Knowledge Discovery from Data 11 2 (2016) 39.","DOI":"10.1145\/2976744"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2015.2476796"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2012.09.049"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.08.047"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340848","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:32Z","timestamp":1750202012000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,24]]},"references-count":46,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,10,31]]}},"alternative-id":["10.1145\/3340848"],"URL":"https:\/\/doi.org\/10.1145\/3340848","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,24]]},"assertion":[{"value":"2018-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-09-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}