{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:39:49Z","timestamp":1772206789558,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819755776","type":"print"},{"value":"9789819755783","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-5578-3_20","type":"book-chapter","created":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T07:04:14Z","timestamp":1724137454000},"page":"245-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Enhanced Tree-Seed Algorithm with Double-Layer Cooperation Strategy to Boost Diversity and Exploration Capability for Feature Selection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6099-4877","authenticated-orcid":false,"given":"Xianqiu","family":"Meng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4450-7941","authenticated-orcid":false,"given":"Gaochao","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5856-7737","authenticated-orcid":false,"given":"Xu","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1953-8308","authenticated-orcid":false,"given":"Long","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0384-1338","authenticated-orcid":false,"given":"Shuai","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9149-2922","authenticated-orcid":false,"given":"Jianhua","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4509-0609","authenticated-orcid":false,"given":"Yandi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,21]]},"reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"4089","DOI":"10.1007\/s10489-021-02605-x","volume":"52","author":"M Dadvar","year":"2022","unstructured":"Dadvar, M., Navidi, H., Javadi, H.H.S., Mirzarezaee, M.: A cooperative approach for combining particle swarm optimization and differential evolution algorithms to solve single-objective optimization problems. Appl. Intell. 52(4), 4089\u20134108 (2022)","journal-title":"Appl. Intell."},{"key":"20_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2019.101788","volume":"127","author":"C Banchhor","year":"2020","unstructured":"Banchhor, C., Srinivasu, N.: Integrating cuckoo search-grey wolf optimization and correlative naive bayes classifier with map reduce model for big data classification. Data Knowl. Eng. 127, 101788 (2020)","journal-title":"Data Knowl. Eng."},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1162\/NECO_a_00793","volume":"28","author":"D Gomez","year":"2016","unstructured":"Gomez, D., Rojas, A.: An empirical overview of the no free lunch theorem and its effect on real-world machine learning classification. Neural Comput. 28(1), 216\u2013228 (2016)","journal-title":"Neural Comput."},{"key":"20_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107291","volume":"228","author":"A Mortazavi","year":"2021","unstructured":"Mortazavi, A., Moloodpoor, M.: Enhanced butterfly optimization algorithm with a new fuzzy regulator strategy and virtual butterfly concept. Knowl.-Based Syst. 228, 107291 (2021)","journal-title":"Knowl.-Based Syst."},{"issue":"19","key":"20_CR5","doi-asserted-by":"publisher","first-page":"6686","DOI":"10.1016\/j.eswa.2015.04.055","volume":"42","author":"MS Kiran","year":"2015","unstructured":"Kiran, M.S.: TSA: Tree-seed algorithm for continuous optimization. Expert Syst. Appl. 42(19), 6686\u20136698 (2015)","journal-title":"Expert Syst. Appl."},{"key":"20_CR6","first-page":"1","volume":"3","author":"S Arora","year":"2018","unstructured":"Arora, S., Singh, S.: Butterfly optimization algorithm: a novel approach for global optimization. Soft. Comput. 3, 1\u201320 (2018)","journal-title":"Soft. Comput."},{"key":"20_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106314","volume":"92","author":"J Jiang","year":"2020","unstructured":"Jiang, J., Meng, X., Chen, Y., Qiu, C., Liu, Y., Li, K.: Enhancing Tree-seed algorithm via feed-back mechanism for optimizing continuous problems. Appl. Soft Comput. 92, 106314 (2020)","journal-title":"Appl. Soft Comput."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Sharma, S., Saha, A.K.: M-MBOA: a novel butterfly optimization algorithm enhanced with mutualism scheme. Soft Computing, 1\u201319 (2019)","DOI":"10.1007\/s00500-019-04234-6"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.18201\/ijisae.2019253192","volume":"7","author":"MA Sahman","year":"2019","unstructured":"Sahman, M.A., Cinar, A.C.: Binary Tree-seed algorithms with s-shaped and v-shaped transfer functions. Int. J. Intell. Syst. Appl. Eng. 7(2), 111\u2013117 (2019)","journal-title":"Int. J. Intell. Syst. Appl. Eng."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Zhou, X., et al.: Boosted local dimensional mutation and all-dimensional neighborhood slime mould algorithm for feature selection. Neurocomputing 126467 (2023)","DOI":"10.1016\/j.neucom.2023.126467"},{"key":"20_CR11","unstructured":"Asuncion, A., Newman, D.: UCI machine learning repository. Irvine, CA, USA(2007)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"8041","DOI":"10.1109\/ACCESS.2020.2964321","volume":"8","author":"I Tumar","year":"2020","unstructured":"Tumar, I., Hassouneh, Y., Turabieh, H., Thaher, T.: Enhanced binary moth flame optimization as a feature selection algorithm to predict software fault prediction. IEEE Access 8, 8041\u20138055 (2020)","journal-title":"IEEE Access"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s11047-009-9175-3","volume":"9","author":"E Rashedi","year":"2010","unstructured":"Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: BGSA: binary gravitational search algorithm. Nat. Comput. 9, 727\u2013745 (2010)","journal-title":"Nat. Comput."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"S Mirjalili","year":"2013","unstructured":"Mirjalili, S., Lewis, A.: S-shaped versus v-shaped transfer functions for binary particle swarm optimization. Swarm Evol. Comput. 9, 1\u201314 (2013)","journal-title":"Swarm Evol. Comput."},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s00521-013-1525-5","volume":"25","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili, S., Mirjalili, S.M., Yang, X.-S.: Binary bat algorithm. Neural Comput. Appl. 25, 663\u2013681 (2014)","journal-title":"Neural Comput. Appl."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Faris, H., et al.: An efficient binary salp swarm algorithm with crossover scheme for feature selection problems. Knowl.-Based Syst. 154, 43\u201367 (2018)","DOI":"10.1016\/j.knosys.2018.05.009"},{"key":"20_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107469","volume":"159","author":"M Abdel-Basset","year":"2021","unstructured":"Abdel-Basset, M., Mohamed, R., Sallam, K.M., Chakrabortty, R.K., Ryan, M.J.: BSMA: A novel metaheuristic algorithm for multi-dimensional knapsack problems: method and comprehensive analysis. Comput. Ind. Eng. 159, 107469 (2021)","journal-title":"Comput. Ind. Eng."},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.asoc.2017.11.006","volume":"62","author":"M Mafarja","year":"2018","unstructured":"Mafarja, M., Mirjalili, S.: Whale optimization approaches for wrapper feature selection. Appl. Soft Comput. 62, 441\u2013453 (2018)","journal-title":"Appl. Soft Comput."},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"139792","DOI":"10.1109\/ACCESS.2021.3117853","volume":"9","author":"M Abdel-Basset","year":"2021","unstructured":"Abdel-Basset, M., Sallam, K.M., Mohamed, R., Elgendi, I., Munasinghe, K., Elkomy, O.M.: An improved binary grey-wolf optimizer with simulated annealing for feature selection. IEEE Access 9, 139792\u2013139822 (2021)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-5578-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T07:07:13Z","timestamp":1724137633000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-5578-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819755776","9789819755783"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-5578-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"21 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2024\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}