{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:57:50Z","timestamp":1742975870504,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031466762"},{"type":"electronic","value":"9783031466779"}],"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-46677-9_21","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:02:29Z","timestamp":1699102949000},"page":"293-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Feature Selection Method for High Dimensional Data Based on Improved BOA in AIoT"],"prefix":"10.1007","author":[{"given":"Weifeng","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bowei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"issue":"4","key":"21_CR1","first-page":"1060","volume":"34","author":"UM Khaire","year":"2022","unstructured":"Khaire, U.M., Dhanalakshmi, R.: Stability of feature selection algorithm: a review. J. King Saud Univ.-Comput. Inf. Sci. 34(4), 1060\u20131073 (2022)","journal-title":"J. King Saud Univ.-Comput. Inf. Sci."},{"key":"21_CR2","doi-asserted-by":"publisher","unstructured":"Rahab, H., et al.: A modified binary rat swarm optimization algorithm for feature selection in Arabic sentiment analysis. Arab. J. Sci. Eng. 48, 1\u201328 (2022). https:\/\/doi.org\/10.1007\/s13369-022-07466-1","DOI":"10.1007\/s13369-022-07466-1"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Liu, Yi, et al.: An Interpretable Feature Selection Based on Particle Swarm Optimization. IEICE TRANSACTIONS on Information and Systems. 105(8), 1495\u20131500 (2022)","DOI":"10.1587\/transinf.2021EDL8095"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Zivkovic, M., et al.: Novel improved salp swarm algorithm: an application for feature selection. Sensors 22(5), 1711 (2022)","DOI":"10.3390\/s22051711"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Hamdi, M., et al.: Chicken swarm-based feature subset selection with optimal machine learning enabled data mining approach. Appl. Sci. 12(13), 6787 (2022)","DOI":"10.3390\/app12136787"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Barioul, R., et al.: Random walk binary grey wolf optimization for feature selection in sEMG based hand gesture recognition. In: 2022 IEEE 9th International Conference on Computational Intelligence and Virtual Environments for Measurement Systems and Applications (CIVEMSA), pp. 1\u20136 (2022)","DOI":"10.1109\/CIVEMSA53371.2022.9853687"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Strumberger, I., et al.: Feature selection by hybrid binary ant lion optimizer with covid-19 dataset. In: 2021 29th Telecommunications Forum (TELFOR), pp. 1\u20134 (2021)","DOI":"10.1109\/TELFOR52709.2021.9653256"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Lee, C-Y., Truong-An, L., Yu-Ting, L.: A feature selection approach hybrid grey wolf and heap-based optimizer applied in bearing fault diagnosis. IEEE Access 10, 56691\u201356705 (2022)","DOI":"10.1109\/ACCESS.2022.3177735"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Nath, R.K., Himanshu, T., Travis S.H.: Quantum annealing for automated feature selection in stress detection. In: 2021 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), pp. 453\u2013457 (2021)","DOI":"10.1109\/ISVLSI51109.2021.00089"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Zeggari, A., Zianou, A.S., Fella, H.: Re-weighting features selection based on wrapper filter and genetic algorithms for figurative images recognition. In: 2021 5th International Conference on Pattern Recognition and Image Analysis (IPRIA), pp. 1\u20136 (2021)","DOI":"10.1109\/IPRIA53572.2021.9483538"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Siddamallappa, K.U., Nisarg, G.: Design feature selection and classifiers for hybrid feature selection-particle swarm optimization (HFS-PSO). In: 2022 4th International Conference on Inventive Research in Computing Applications (ICIRCA), pp. 822\u2013826 (2022)","DOI":"10.1109\/ICIRCA54612.2022.9985472"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Huang, G., Fei, H., Qing-Hua, L.: An improved feature selection algorithm with cyclic penalty boundary interaction based on MOPSO. In: 2022 5th International Conference on Pattern Recognition and Artificial Intelligence (PRAI), pp. 164\u2013168 (2022)","DOI":"10.1109\/PRAI55851.2022.9904008"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Wang, Jiachen.: An Improved Genetic Algorithm for Web Phishing Detection Feature Selection. In: 2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML), pp. 130\u2013134 (2022)","DOI":"10.1109\/CACML55074.2022.00029"},{"issue":"6","key":"21_CR14","doi-asserted-by":"publisher","first-page":"23304","DOI":"10.1109\/ACCESS.2022.3153038","volume":"10","author":"AA Ewees","year":"2022","unstructured":"Ewees, A.A., Gaheen, M.A., Yaseen, Z.M., et al.: Grasshopper optimization algorithm with crossover operators for feature selection and solving engineering problems. IEEE Access 10(6), 23304\u201323320 (2022)","journal-title":"IEEE Access"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Apriyadi, M.R., Dian, P.R.: Implementation of feature selection based on particle swarm optimization and genetic algorithm on support vector regression algorithm to predict student performance. In: 2022 International Conference on Informatics, Multimedia, Cyber and Information System (ICIMCIS), pp. 395\u2013400 (2022)","DOI":"10.1109\/ICIMCIS56303.2022.10017972"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Slezkin, A.O., Ilya A.H., Alexander, A.S.: Binarization of the Swallow swarm optimization for feature selection. Program. Comput. Softw. 47, 374\u2013388 (2021)","DOI":"10.1134\/S0361768821050066"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Jameel, N., Hasanen, S.A.: A proposed intelligent features selection method using meerkat clan algorithm. J. Phys. Conf. Ser. 1804(1), 012061 (2021)","DOI":"10.1088\/1742-6596\/1804\/1\/012061"},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.eswa.2005.09.024","volume":"31","author":"CL Huang","year":"2006","unstructured":"Huang, C.L., Wang, C.J.: A GA-based feature selection and parameters optimizationfor support vector machines. Expert Syst. Appl. 31(2), 231\u2013240 (2006)","journal-title":"Expert Syst. Appl."},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Dara, S., Banka, H.: A binary PSO feature selection algorithm for gene expression data. In: International Conference on Advances in Communication and Computing Technologies (ICACACT 2014), pp. 1\u20136 (2014)","DOI":"10.1109\/EIC.2015.7230734"},{"issue":"4","key":"21_CR20","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.neucom.2015.06.083","volume":"172","author":"E Emary","year":"2016","unstructured":"Emary, E., Zawbaa, H.M., Hassanien, A.E.: Binary grey wolf optimization approaches for feature selection. Neurocomputing 172(4), 371\u2013381 (2016)","journal-title":"Neurocomputing"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46677-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:24:06Z","timestamp":1699104246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46677-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466762","9783031466779"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46677-9_21","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":"5 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","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":"27 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2023.uqcloud.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes. Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"503","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":"216","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":"0","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":"43% - 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.97","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":"3.77","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}