{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T01:04:28Z","timestamp":1779498268643,"version":"3.53.1"},"publisher-location":"Cham","reference-count":24,"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_6","type":"book-chapter","created":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T10:07:17Z","timestamp":1653300437000},"page":"65-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Multi-objective Optimization Algorithm with\u00a0Improved Neighborhood Rough Sets for\u00a0Feature Selection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4032-6980","authenticated-orcid":false,"given":"Tao","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3860-3662","authenticated-orcid":false,"given":"Jiucheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6328-4413","authenticated-orcid":false,"given":"Meng","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3760-357X","authenticated-orcid":false,"given":"Zhigang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"6_CR1","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon, I., Elisseeff, A.: An introduction to variable feature selection. J. Mach. Learn. Res. 3, 1157\u20131182 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Chandrashekar, G., Sahin, F.: A survey on feature selection methods. Pergamon Press, Inc. (2014)","DOI":"10.1016\/j.compeleceng.2013.11.024"},{"key":"6_CR3","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"},{"issue":"1","key":"6_CR4","first-page":"20","volume":"18","author":"A Mukhopadhyay","year":"2014","unstructured":"Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., Coello, C.A.C.: Survey of multiobjective evolutionary algorithms for data mining: Part II. IEEE Trans. Comput. 18(1), 20\u201335 (2014)","journal-title":"IEEE Trans. Comput."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.knosys.2017.02.013","volume":"123","author":"AK Das","year":"2017","unstructured":"Das, A.K., Das, S., Ghosh, A.: Ensemble feature selection using bi-objective genetic algorithm. Knowl. Based Syst. 123, 116\u2013127 (2017)","journal-title":"Knowl. Based Syst."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Jimnez, F., Snchez, G., Garca, J.M., Miralles, L., Miralles, L.: Multi-objective evolutionary feature selection for online sales forecasting. Neurocomputing 234(C), 75\u201392 (2016)","DOI":"10.1016\/j.neucom.2016.12.045"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ins.2015.02.031","volume":"307","author":"Z Wang","year":"2015","unstructured":"Wang, Z., Li, M., Li, J.: A multi-objective evolutionary algorithm for feature selection based on mutual information with a new redundancy measure. Inf. Sci. 307, 73\u201388 (2015)","journal-title":"Inf. Sci."},{"issue":"6","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1109\/TSMCB.2012.2227469","volume":"43","author":"B Xue","year":"2013","unstructured":"Xue, B., Zhang, M., Browne, W.N.: Particle swarm optimization for feature selection in classification: A multi-objective approach. IEEE Trans. Cybern. 43(6), 1656\u20131671 (2013)","journal-title":"IEEE Trans. Cybern."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Gong, D.W., Zhang, W.Q.: Feature selection of unreliable data using an improved multi-objective PSO algorithm. Neurocomputing 171(C), 1281\u20131290 (2015)","DOI":"10.1016\/j.neucom.2015.07.057"},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/TEVC.2020.3016049","volume":"25","author":"H Xu","year":"2021","unstructured":"Xu, H., Xue, B., Zhang, M.: A duplication analysis-based evolutionary algorithm for biobjective feature selection. IEEE Trans. Evolution. Comput. 25(2), 205\u2013218 (2021)","journal-title":"IEEE Trans. Evolution. Comput."},{"issue":"9","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1974","DOI":"10.1109\/TNNLS.2016.2562670","volume":"28","author":"X Jin","year":"2017","unstructured":"Jin, X., Bo, T., He, H., Hong, M.: Semisupervised feature selection based on relevance and redundancy criteria. IEEE Trans. Neural Netw. Learn. Syst. 28(9), 1974\u20131984 (2017)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.knosys.2016.10.030","volume":"116","author":"Y Zhu","year":"2017","unstructured":"Zhu, Y., Liang, J., Chen, J., Ming, Z.: An improved NSGA-III algorithm for feature selection used in intrusion detection. Knowl. Based Syst. 116, 74\u201385 (2017)","journal-title":"Knowl. Based Syst."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Robnik, Ikonja, M., Kononenko, I.: Theoretical and empirical analysis of relieff and rrelieff. Mach. Learn. 53(1\u20132), 23\u201369 (2003)","DOI":"10.1023\/A:1025667309714"},{"issue":"8","key":"6_CR15","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","volume":"27","author":"H Peng","year":"2005","unstructured":"Peng, H., Long, F., Ding, C.: Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy. IEEE Trans. Pattern Anal. Mach. Intell. 27(8), 1226\u20131238 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"6_CR16","volume-title":"Elements of Information Theory","author":"TM Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, Tsinghua University Press (1991)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Scholkopf, B., Platt, J., Hofmann, T.: Sparse multinomial logistic regression via Bayesian l1 regularisation. In: International Conference on Neural Information Processing Systems, pp. 209\u2013216 (2006)","DOI":"10.7551\/mitpress\/7503.003.0031"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.asoc.2017.12.048","volume":"65","author":"H Dong","year":"2018","unstructured":"Dong, H., Li, T., Ding, R., Sun, J.: A novel hybrid genetic algorithm with granular information for feature selection and optimization. Appl. Soft. Comput. 65, 33\u201346 (2018)","journal-title":"Appl. Soft. Comput."},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.ins.2021.02.061","volume":"565","author":"A Ot","year":"2021","unstructured":"Ot, A., Ttn, B., Sm, C.: A novel wrapper-based feature subset selection method using modified binary differential evolution algorithm. Inf. Sci. 565, 278\u2013305 (2021)","journal-title":"Inf. Sci."},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Yang, C.S., Chuang, L.Y., Ke, C.H., Yang, C.H.: Boolean binary particle swarm optimization for feature selection. Evol. Comput. 2093\u20132098 (2008)","DOI":"10.1109\/CEC.2008.4631076"},{"issue":"6","key":"6_CR21","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.engappai.2014.03.007","volume":"32","author":"S Tabakhi","year":"2014","unstructured":"Tabakhi, S., Moradi, P., Akhlaghian, F.: An unsupervised feature selection algorithm based on ant colony optimization. Eng. Appl. Artif. Intel 32(6), 112\u2013123 (2014)","journal-title":"Eng. Appl. Artif. Intel"},{"issue":"4","key":"6_CR22","first-page":"1","volume":"219","author":"F Kl","year":"2021","unstructured":"Kl, F., Kaya, Y., Yildirim, S.: A novel multi population based particle swarm optimization for feature selection. Knowl. Based Syst 219(4), 1\u201314 (2021)","journal-title":"Knowl. Based Syst"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Liu, W., Li, H.: The performance of a new version of moea\/d on cec09 unconstrained mop test instances. In: IEEE Congress on Evolutionary Computation (CEC 2009), pp. 203\u2013208 (2009)","DOI":"10.1109\/CEC.2009.4982949"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.patrec.2017.01.004","volume":"88","author":"A Das","year":"2017","unstructured":"Das, A., Das, S.: Feature weighting and selection with a pareto-optimal trade-off between relevancy and redundancy. Pattern Recogn. Lett. 88, 12\u201319 (2017)","journal-title":"Pattern Recogn. Lett."}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T00:05:01Z","timestamp":1779494701000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-03948-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031039478","9783031039485"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-03948-5_6","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"}]}}