{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T22:36:03Z","timestamp":1775687763383,"version":"3.50.1"},"reference-count":54,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T00:00:00Z","timestamp":1722211200000},"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":["62376127, 61876089, 61876185, and 61902281"],"award-info":[{"award-number":["62376127, 61876089, 61876185, and 61902281"]}],"id":[{"id":"10.13039\/501100001809","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"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Evol. Learn. Optim."],"published-print":{"date-parts":[[2024,9,30]]},"abstract":"<jats:p>Feature selection (FS) is an important data pre-processing technique in classification. It aims to remove redundant and irrelevant features from the data, which reduces the dimensionality of data and improves the performance of the classifier. Thus, FS is a bi-objective optimization problem, and evolutionary algorithms (EAs) have been proven to be effective in solving bi-objective FS problems. EA is a population-based metaheuristic algorithm, and the quality of the initial population is an important factor affecting the performance of EA. An improper initial population may negatively affect the convergence speed of the EA and even make the algorithm fall into the local optimum. In this article, we propose a similarity and mutual information-based initialization method, named SMII, to improve the quality of the initial population. This method determines the distribution of initial solutions based on similarity and shields features with high correlation to the selected features according to mutual information. In the experiment, we embed SMII, the latest four initialization methods, and a traditional random initialization method into NSGA-II and compared their performance on 15 public datasets. The experimental results show that SMII performs best on most datasets and can effectively improve the performance of the algorithm. Moreover, we compare the performance of two other EAs before and after embedding SMII on 15 datasets, and the results further prove that the proposed method can effectively improve the search capability of the EA for FS.<\/jats:p>","DOI":"10.1145\/3653025","type":"journal-article","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T14:27:17Z","timestamp":1710858437000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A Population Initialization Method Based on Similarity and Mutual Information in Evolutionary Algorithm for Bi-Objective Feature Selection"],"prefix":"10.1145","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9214-6725","authenticated-orcid":false,"given":"Xu","family":"Cai","sequence":"first","affiliation":[{"name":"Artificial Intelligence Research Institute and School of Information and Control Engineering, China University of Mining and Technology, Xuzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9069-7547","authenticated-orcid":false,"given":"Yu","family":"Xue","sequence":"additional","affiliation":[{"name":"School of Software, Nanjing University of Information Science and Technology, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,7,29]]},"reference":[{"key":"e_1_3_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2012.09.003"},{"key":"e_1_3_1_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbab354"},{"key":"e_1_3_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.06.032"},{"key":"e_1_3_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106342"},{"key":"e_1_3_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_3_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.06.063"},{"key":"e_1_3_1_8_1","volume-title":"UCI Machine Learning Repository","author":"Dua Dheeru","year":"2017","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. University of California."},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108509"},{"key":"e_1_3_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3545-7"},{"key":"e_1_3_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-021-05990-z"},{"key":"e_1_3_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-019-09800-w"},{"issue":"3","key":"e_1_3_1_13_1","first-page":"1747","article-title":"Wrapper framework for test-cost-sensitive feature selection","volume":"51","author":"Jiang Liangxiao","year":"2019","unstructured":"Liangxiao Jiang, Ganggang Kong, and Chaoqun Li. 2019. Wrapper framework for test-cost-sensitive feature selection. IEEE Transactions on Systems, Man, and Cybernetics: Systems 51, 3 (2019), 1747\u20131756.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"e_1_3_1_14_1","first-page":"1","article-title":"A survey on evolutionary multiobjective feature selection in classification: Approaches, applications, and challenges","author":"Jiao Ruwang","year":"2023","unstructured":"Ruwang Jiao, Bach Hoai Nguyen, Bing Xue, and Mengjie Zhang. 2023. A survey on evolutionary multiobjective feature selection in classification: Approaches, applications, and challenges. IEEE Transactions on Evolutionary Computation (2023), 1\u20131.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119130"},{"key":"e_1_3_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107302"},{"key":"e_1_3_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3136625"},{"key":"e_1_3_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3149601"},{"key":"e_1_3_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113981"},{"key":"e_1_3_1_20_1","doi-asserted-by":"publisher","DOI":"10.3390\/s20236793"},{"key":"e_1_3_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100663"},{"key":"e_1_3_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114765"},{"key":"e_1_3_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105285"},{"key":"e_1_3_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.159"},{"key":"e_1_3_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2014.08.001"},{"key":"e_1_3_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119428"},{"key":"e_1_3_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2015.2415482"},{"key":"e_1_3_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120480"},{"key":"e_1_3_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3061152"},{"key":"e_1_3_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3175226"},{"key":"e_1_3_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107804"},{"key":"e_1_3_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2791283"},{"key":"e_1_3_1_33_1","doi-asserted-by":"publisher","DOI":"10.1201\/b17320"},{"key":"e_1_3_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2017.2742868"},{"key":"e_1_3_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2918140"},{"key":"e_1_3_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2869405"},{"key":"e_1_3_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3168052"},{"key":"e_1_3_1_38_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9211"},{"key":"e_1_3_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107633"},{"key":"e_1_3_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.106041"},{"key":"e_1_3_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.02.031"},{"key":"e_1_3_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.851275"},{"key":"e_1_3_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390192"},{"key":"e_1_3_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.3016049"},{"key":"e_1_3_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2012.2227469"},{"key":"e_1_3_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.09.018"},{"key":"e_1_3_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2504420"},{"key":"e_1_3_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109420"},{"key":"e_1_3_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340848"},{"key":"e_1_3_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107218"},{"key":"e_1_3_1_51_1","first-page":"159","volume-title":"Proceedings of Paci\ufb01c Rim Knowledge Acquisition Work-Shop","author":"Yang Ying","year":"2002","unstructured":"Ying Yang and Geoffrey I. Webb. 2002. A comparative study of discretization methods for Naive-Bayes classifiers. In Proceedings of Paci\ufb01c Rim Knowledge Acquisition Work-Shop, 159\u2013173."},{"key":"e_1_3_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3106975"},{"key":"e_1_3_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113842"},{"key":"e_1_3_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2022.3163577"},{"key":"e_1_3_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100770"}],"container-title":["ACM Transactions on Evolutionary Learning and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3653025","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3653025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:56:55Z","timestamp":1750291015000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3653025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,29]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9,30]]}},"alternative-id":["10.1145\/3653025"],"URL":"https:\/\/doi.org\/10.1145\/3653025","relation":{},"ISSN":["2688-3007"],"issn-type":[{"value":"2688-3007","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,29]]},"assertion":[{"value":"2023-07-21","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}