{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T01:04:34Z","timestamp":1779498274572,"version":"3.53.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031039478","type":"print"},{"value":"9783031039485","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-03948-5_3","type":"book-chapter","created":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T10:07:17Z","timestamp":1653300437000},"page":"30-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Novel Feature Selection Algorithm Based on\u00a0Aquila Optimizer for\u00a0COVID-19 Classification"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9289-3544","authenticated-orcid":false,"given":"Ling","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3128-9025","authenticated-orcid":false,"given":"Jeng-Shyang","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6209-9574","authenticated-orcid":false,"given":"Zhongjie","family":"Zhuang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2117-0618","authenticated-orcid":false,"given":"Shu-Chuan","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"3_CR1","unstructured":"From WHO Coronavirus (COVID-19) Dashboard. https:\/\/covid19.who.int\/"},{"key":"3_CR2","unstructured":"From the Report of CBS NEWS. https:\/\/www.cbsnews.com\/news\/omicron-89-countries-cases-doubling-fast-world-health-organization\/"},{"issue":"7","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1007\/s10096-020-03901-z","volume":"39","author":"D Singh","year":"2020","unstructured":"Singh, D., Kumar, V., Kaur, M., et al.: Classification of COVID-19 patients from chest CT images using multi-objective differential evolution-based convolutional neural networks. Eur. J. Clin. Microbiol. Infect. Dis. 39(7), 1379\u20131389 (2020). https:\/\/doi.org\/10.1007\/s10096-020-03901-z","journal-title":"Eur. J. Clin. Microbiol. Infect. Dis."},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1109\/TCYB.2017.2780274","volume":"49","author":"GG Wang","year":"2017","unstructured":"Wang, G.G., Tan, Y.: Improving metaheuristic algorithms with information feedback models. IEEE Trans. Cybern. 49(2), 542\u2013555 (2017). https:\/\/doi.org\/10.1109\/TCYB.2017.2780274","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"3_CR5","first-page":"117","volume":"6","author":"XW Xu","year":"2021","unstructured":"Xu, X.W., Pan, T.S., Song, P.C., Hu, C.C., Chu, S.C.: Multi-cluster based equilibrium optimizer algorithm with compact approach for power system network. J. Netw. Intell. 6(1), 117\u2013142 (2021)","journal-title":"J. Netw. Intell."},{"issue":"1","key":"3_CR6","first-page":"1","volume":"12","author":"J Wu","year":"2021","unstructured":"Wu, J., Xu, M., Liu, F.F., Huang, M., Ma, L., Lu, Z.M.: Solar wireless sensor network routing algorithm based on multi-objective particle swarm optimization. J. Inf. Hiding Multim. Signal Process. 12(1), 1\u201311 (2021)","journal-title":"J. Inf. Hiding Multim. Signal Process."},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"107078","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. Indust. Eng. 153, 107078 (2021). https:\/\/doi.org\/10.1016\/j.cie.2020.107078","journal-title":"Comput. Indust. Eng."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"105746","DOI":"10.1016\/j.knosys.2020.105746","volume":"195","author":"P Hu","year":"2020","unstructured":"Hu, P., Pan, J.S., Chu, S.C.: Improved binary grey wolf optimizer and its application for feature selection. Knowl. Based Syst. 195, 105746 (2020). https:\/\/doi.org\/10.1016\/j.knosys.2020.105746","journal-title":"Knowl. Based Syst."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2019.08.040","volume":"507","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Gong, D.W., Gao, X.Z., Tian, T., Sun, X.Y.: Binary differential evolution with self-learning for multi-objective feature selection. Inf. Sci. 507, 67\u201385 (2020). https:\/\/doi.org\/10.1016\/j.ins.2019.08.040","journal-title":"Inf. Sci."},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Pan, J.S., Tian, A.Q., Chu, S.C., Li, J.B.: Improved binary pigeon-inspired optimization and its application for feature selection. Appl. Intell. 1\u201319 (2021). https:\/\/doi.org\/10.1007\/s10489-021-02302-9","DOI":"10.1007\/s10489-021-02302-9"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Du, Z.-G., Pan, T.-S., Pan, J.-S., Chu, S.-C.: QUasi-Affine TRansformation evolutionary algorithm for feature selection. In: Wu, T.-Y., Ni, S., Chu, S.-C., Chen, C.-H., Favorskaya, M. (eds.) Advances in Smart Vehicular Technology, Transportation, Communication and Applications. SIST, vol. 250, pp. 147\u2013156. Springer, Singapore (2022). https:\/\/doi.org\/10.1007\/978-981-16-4039-1_14","DOI":"10.1007\/978-981-16-4039-1_14"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Abualigah, L., Yousri, D., Abd Elaziz, M., Ewees, A.A., Al-qaness, M.A., Gandomi, A.H.: Aquila optimizer: a novel meta-heuristic optimization algorithm. Comput. Indust. Eng. 157, 107250 (2021). https:\/\/doi.org\/10.1016\/j.cie.2021.107250","DOI":"10.1016\/j.cie.2021.107250"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Abd Elaziz, M., Dahou, A., Alsaleh, N.A., Elsheikh, A.H., Saba, A.I., Ahmadein, M.: Boosting covid-19 image classification using Mobilenetv3 and aquila optimizer algorithm. Entropy 23(11) (2021). https:\/\/doi.org\/10.3390\/e23111383","DOI":"10.3390\/e23111383"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Howard, A., et al.: Searching for Mobilenetv3. In: Proceedings of the IEEE\/CVF International Conference on Computer Vision, pp. 1314\u20131324 (2019)","DOI":"10.1109\/ICCV.2019.00140"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Pan, J.S., Tsai, P.W., Liao, Y.B.: Fish migration optimization based on the fishy biology. In: 2010 Fourth International Conference on Genetic and Evolutionary Computing, pp. 783\u2013786. IEEE (2010)","DOI":"10.1109\/ICGEC.2010.198"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Chu, S.-C., Tsai, P.-W., Pan, J.-S.: Cat swarm optimization. In: Yang, Q., Webb, G. (eds.) PRICAI 2006. LNCS (LNAI), vol. 4099, pp. 854\u2013858. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/978-3-540-36668-3_94","DOI":"10.1007\/978-3-540-36668-3_94"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Pan, J.S., Song, P.C., Pan, C.A., Abraham, A.: The phasmatodea population evolution algorithm and its application in 5G heterogeneous network downlink power allocation problem. J. Internet Technol. 22(6), 1199\u20131213 (2021)","DOI":"10.53106\/160792642021112206001"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Pan, J.-S., Meng, Z., Xu, H., Li, X.: QUasi-Affine TRansformation Evolution (QUATRE) algorithm: a new simple and accurate structure for global optimization. In: Fujita, H., Ali, M., Selamat, A., Sasaki, J., Kurematsu, M. (eds.) IEA\/AIE 2016. LNCS (LNAI), vol. 9799, pp. 657\u2013667. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42007-3_57","DOI":"10.1007\/978-3-319-42007-3_57"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995). https:\/\/doi.org\/10.1007\/BF00994018","DOI":"10.1007\/BF00994018"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Emary, E., Zawbaa, H.M., Hassanien, A.E.: Binary grey wolf optimization approaches for feature selection. Neurocomputing 172, 371\u2013381 (2016). https:\/\/doi.org\/10.1016\/j.neucom.2015.06.083","DOI":"10.1016\/j.neucom.2015.06.083"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Li, L., Pan, T.S., Sun, X.X., Chu, S.C., Pan, J.S.: A novel binary slime mould algorithm with au strategy for cognitive radio spectrum allocation. Int. J. Comput. Intell. Syst. 14(1), 1\u201318 (2021). https:\/\/doi.org\/10.1007\/s44196-021-00005-0","DOI":"10.1007\/s44196-021-00005-0"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Tizhoosh, H.R.: Opposition-based learning: a new scheme for machine intelligence. In: International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC 2006), vol. 1, pp. 695\u2013701. IEEE (2005). https:\/\/doi.org\/10.1109\/CIMCA.2005.1631345","DOI":"10.1109\/CIMCA.2005.1631345"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Maftouni, M., Law, A.C.C., Shen, B., Grado, Z.J.K., Zhou, Y., Yazdi, N.A.: A robust ensemble-deep learning model for COVID-19 diagnosis based on an integrated CT scan images database. In: Proceedings of the IIE Annual Conference, pp. 632\u2013637. Institute of Industrial and Systems Engineers (IISE) (2021)","DOI":"10.1080\/24725579.2022.2142866"},{"key":"3_CR24","unstructured":"Yang, X., He, X., Zhao, J., Zhang, Y., Zhang, S., Xie, P.: COVID-CT-dataset: a CT scan dataset about COVID-19 (2020)"},{"key":"3_CR25","unstructured":"Angelov, P., Almeida Soares, E.: SARS-CoV-2 CT-scan dataset: a large dataset of real patients CT scans for SARS-CoV-2 identification. MedRxiv (2020). https:\/\/www.kaggle.com\/plameneduardo\/sarscov2-ctscan-dataset"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Sen, S., Saha, S., Chatterjee, S., Mirjalili, S., Sarkar, R.: A bi-stage feature selection approach for COVID-19 prediction using chest CT images. Appl. Intell. 1\u201316 (2021). https:\/\/doi.org\/10.1007\/s10489-021-02292-8","DOI":"10.1007\/s10489-021-02292-8"},{"key":"3_CR27","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1016\/j.knosys.2018.05.009","DOI":"10.1016\/j.knosys.2018.05.009"}],"container-title":["IFIP Advances in Information and Communication Technology","Intelligent Information Processing XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-03948-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T00:05:40Z","timestamp":1779494740000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-03948-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031039478","9783031039485"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-03948-5_3","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1868-422X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iip2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.intsci.ac.cn\/iip2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 reviews per paper","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":"56","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":"37","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":"6","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":"66% - 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":"3","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":"4","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}