{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:06:31Z","timestamp":1743051991170,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031402821"},{"type":"electronic","value":"9783031402838"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-40283-8_15","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T23:02:48Z","timestamp":1691535768000},"page":"164-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Enhanced Fitness-Distance Balance Slime Mould Algorithm and\u00a0Its Application in\u00a0Feature Selection"],"prefix":"10.1007","author":[{"given":"Haijia","family":"Bao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ya","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.107078","volume":"153","author":"M Abdel-Basset","year":"2021","unstructured":"Abdel-Basset, M., Mohamed, R., Chakrabortty, R.K., Ryan, M.J., Mirjalili, S.: An efficient binary slime mould algorithm integrated with a novel attacking-feeding strategy for feature selection. Comput. Ind. Eng. 153, 107078 (2021)","journal-title":"Comput. Ind. Eng."},{"issue":"5","key":"15_CR2","doi-asserted-by":"publisher","first-page":"3979","DOI":"10.1007\/s10462-021-10100-5","volume":"55","author":"O Altay","year":"2022","unstructured":"Altay, O.: Chaotic slime mould optimization algorithm for global optimization. Artif. Intell. Rev. 55(5), 3979\u20134040 (2022)","journal-title":"Artif. Intell. Rev."},{"key":"15_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100821","volume":"61","author":"S Aras","year":"2021","unstructured":"Aras, S., Gedikli, E., Kahraman, H.T.: A novel stochastic fractal search algorithm with fitness-distance balance for global numerical optimization. Swarm Evol. Comput. 61, 100821 (2021)","journal-title":"Swarm Evol. Comput."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"6577","DOI":"10.1007\/s00500-021-05654-z","volume":"25","author":"S Duman","year":"2021","unstructured":"Duman, S., Kahraman, H.T., Guvenc, U., Aras, S.: Development of a L\u00e9vy flight and FDB-based coyote optimization algorithm for global optimization and real-world ACOPF problems. Soft. Comput. 25, 6577\u20136617 (2021)","journal-title":"Soft. Comput."},{"key":"15_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.104763","volume":"111","author":"S Duman","year":"2022","unstructured":"Duman, S., Kahraman, H.T., Sonmez, Y., Guvenc, U., Kati, M., Aras, S.: A powerful meta-heuristic search algorithm for solving global optimization and real-world solar photovoltaic parameter estimation problems. Eng. Appl. Artif. Intell. 111, 104763 (2022)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Eberhart, R., Kennedy, J.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942\u20131948. Citeseer (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Houssein, E.H., Helmy, B.E.d., Rezk, H., Nassef, A.M.: An efficient orthogonal opposition-based learning slime mould algorithm for maximum power point tracking. Neural Comput. Appl. 1\u201325 (2022)","DOI":"10.1007\/s00521-021-06634-y"},{"key":"15_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115870","volume":"187","author":"EH Houssein","year":"2022","unstructured":"Houssein, E.H., Mahdy, M.A., Shebl, D., Manzoor, A., Sarkar, R., Mohamed, W.M.: An efficient slime mould algorithm for solving multi-objective optimization problems. Expert Syst. Appl. 187, 115870 (2022)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"2335","DOI":"10.1002\/int.22776","volume":"37","author":"H Jia","year":"2022","unstructured":"Jia, H., Zhang, W., Zheng, R., Wang, S., Leng, X., Cao, N.: Ensemble mutation slime mould algorithm with restart mechanism for feature selection. Int. J. Intell. Syst. 37(3), 2335\u20132370 (2022)","journal-title":"Int. J. Intell. Syst."},{"key":"15_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105169","volume":"190","author":"HT Kahraman","year":"2020","unstructured":"Kahraman, H.T., Aras, S., Gedikli, E.: Fitness-distance balance (FDB): a new selection method for meta-heuristic search algorithms. Knowl.-Based Syst. 190, 105169 (2020)","journal-title":"Knowl.-Based Syst."},{"key":"15_CR11","doi-asserted-by":"publisher","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., Heidari, A.A., Mirjalili, S.: Slime mould algorithm: a new method for stochastic optimization. Futur. Gener. Comput. Syst. 111, 300\u2013323 (2020)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.apm.2018.07.044","volume":"64","author":"J Luo","year":"2018","unstructured":"Luo, J., Chen, H., Xu, Y., Huang, H., Zhao, X., et al.: An improved grasshopper optimization algorithm with application to financial stress prediction. Appl. Math. Model. 64, 654\u2013668 (2018)","journal-title":"Appl. Math. Model."},{"key":"15_CR13","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":"15_CR14","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46\u201361 (2014)","journal-title":"Adv. Eng. Softw."},{"key":"15_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2022.105858","volume":"148","author":"MH Nadimi-Shahraki","year":"2022","unstructured":"Nadimi-Shahraki, M.H., Zamani, H., Mirjalili, S.: Enhanced whale optimization algorithm for medical feature selection: a COVID-19 case study. Comput. Biol. Med. 148, 105858 (2022)","journal-title":"Comput. Biol. Med."},{"issue":"22","key":"15_CR16","doi-asserted-by":"publisher","first-page":"14297","DOI":"10.1007\/s00500-021-06140-2","volume":"25","author":"MK Naik","year":"2021","unstructured":"Naik, M.K., Panda, R., Abraham, A.: Adaptive opposition slime mould algorithm. Soft. Comput. 25(22), 14297\u201314313 (2021). https:\/\/doi.org\/10.1007\/s00500-021-06140-2","journal-title":"Soft. Comput."},{"key":"15_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107955","volume":"113","author":"MK Naik","year":"2021","unstructured":"Naik, M.K., Panda, R., Abraham, A.: An entropy minimization based multilevel colour thresholding technique for analysis of breast thermograms using equilibrium slime mould algorithm. Appl. Soft Comput. 113, 107955 (2021)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"15_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0301-4622(00)00108-3","volume":"84","author":"T Nakagaki","year":"2000","unstructured":"Nakagaki, T., Yamada, H., Ueda, T.: Interaction between cell shape and contraction pattern in the physarum plasmodium. Biophys. Chem. 84(3), 195\u2013204 (2000)","journal-title":"Biophys. Chem."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.cie.2018.06.017","volume":"123","author":"J Pang","year":"2018","unstructured":"Pang, J., Zhou, H., Tsai, Y.C., Chou, F.D.: A scatter simulated annealing algorithm for the bi-objective scheduling problem for the wet station of semiconductor manufacturing. Comput. Ind. Eng. 123, 54\u201366 (2018)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"1883","DOI":"10.4249\/scholarpedia.1883","volume":"4","author":"LE Peterson","year":"2009","unstructured":"Peterson, L.E.: K-nearest neighbor. Scholarpedia 4(2), 1883 (2009)","journal-title":"Scholarpedia"},{"key":"15_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108271","volume":"257","author":"Y Xu","year":"2022","unstructured":"Xu, Y., Peng, Y., Su, X., Yang, Z., Ding, C., Yang, X.: Improving teaching-learning-based-optimization algorithm by a distance-fitness learning strategy. Knowl.-Based Syst. 257, 108271 (2022)","journal-title":"Knowl.-Based Syst."},{"issue":"5","key":"15_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3340848","volume":"13","author":"Y Xue","year":"2019","unstructured":"Xue, Y., Xue, B., Zhang, M.: Self-adaptive particle swarm optimization for large-scale feature selection in classification. ACM Trans. Knowl. Discov. Data (TKDD) 13(5), 1\u201327 (2019)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Yacoubi, S., Manita, G., Amdouni, H., Mirjalili, S., Korbaa, O.: A modified multi-objective slime mould algorithm with orthogonal learning for numerical association rules mining. Neural Comput. Appl. 1\u201327 (2022)","DOI":"10.1007\/s00521-022-07985-w"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s00500-016-2334-4","volume":"22","author":"WJ Yu","year":"2018","unstructured":"Yu, W.J., Zhan, Z.H., Zhang, J.: Artificial bee colony algorithm with an adaptive greedy position update strategy. Soft. Comput. 22, 437\u2013451 (2018)","journal-title":"Soft. Comput."},{"issue":"4","key":"15_CR25","first-page":"893","volume":"35","author":"N Zhang","year":"2020","unstructured":"Zhang, N., Zhao, Z., Bao, X., Qian, J., Wu, B.: Gravitational search algorithm based on improved tent chaos. Control Decis. 35(4), 893\u2013900 (2020)","journal-title":"Control Decis."},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.neucom.2020.10.038","volume":"430","author":"Y Zhang","year":"2021","unstructured":"Zhang, Y., et al.: Towards augmented kernel extreme learning models for bankruptcy prediction: algorithmic behavior and comprehensive analysis. Neurocomputing 430, 185\u2013212 (2021)","journal-title":"Neurocomputing"},{"key":"15_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.cie.2018.06.018","volume":"123","author":"H Zhou","year":"2018","unstructured":"Zhou, H., Pang, J., Chen, P.K., Chou, F.D.: A modified particle swarm optimization algorithm for a batch-processing machine scheduling problem with arbitrary release times and non-identical job sizes. Comput. Ind. Eng. 123, 67\u201381 (2018)","journal-title":"Comput. Ind. Eng."},{"key":"15_CR28","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.neucom.2015.01.110","volume":"188","author":"Y Zhou","year":"2016","unstructured":"Zhou, Y., Wang, R., Luo, Q.: Elite opposition-based flower pollination algorithm. Neurocomputing 188, 294\u2013310 (2016)","journal-title":"Neurocomputing"}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-40283-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T22:11:32Z","timestamp":1729894292000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40283-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031402821","9783031402838"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40283-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Science, Engineering and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ksem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ksem2023.conferences.academy\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"395","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"114","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}