{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:28:58Z","timestamp":1742981338965,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":26,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811651878"},{"type":"electronic","value":"9789811651885"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-981-16-5188-5_31","type":"book-chapter","created":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T23:04:52Z","timestamp":1629414292000},"page":"432-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Meta-feature Extraction for Multi-objective Optimization Problems"],"prefix":"10.1007","author":[{"given":"Xianghua","family":"Chu","sequence":"first","affiliation":[]},{"given":"Jiayun","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Shuxiang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Linya","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Qiu","family":"He","sequence":"additional","affiliation":[]},{"given":"Guodan","family":"Bao","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,20]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"26194","DOI":"10.1109\/ACCESS.2018.2832181","volume":"6","author":"K Li","year":"2018","unstructured":"Li, K., Wang, R., Zhang, T.: Evolutionary many-objective optimization: a comparative study of the state-of-the-art. IEEE Access 6, 26194\u201326214 (2018)","journal-title":"IEEE Access"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Ma, X., Yang, J., Wu, N.: A comparative study on decomposition-based multi-objective evolutionary algorithms for many-objective optimization. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 2477\u20132483 (2016)","DOI":"10.1109\/CEC.2016.7744096"},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TEVC.2016.2611642","volume":"22","author":"R Wang","year":"2018","unstructured":"Wang, R., Zhou, Z., Ishibuchi, H.: Localized weighted sum method for many-objective optimization. IEEE Trans. Evol. Comput. 22(1), 3\u201318 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"31_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TEVC.2019.2909744","volume":"24","author":"R Tanabe","year":"2020","unstructured":"Tanabe, R., Ishibuchi, H.: A review of evolutionary multimodal multiobjective optimization. IEEE Trans. Evol. Comput. 24(1), 193\u2013200 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"31_CR5","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"S Huband","year":"2006","unstructured":"Huband, S., Hingston, P., Barone, L.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477\u2013506 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"31_CR6","unstructured":"Zitzler, E., Thiele, L.: An evolutionary algorithm for multiobjective optimization: the strength pareto approach. TIK-report, vol. 43 (1998)"},{"issue":"6","key":"31_CR7","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"31_CR8","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2013","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"31_CR9","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.: 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":"31_CR10","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength Pareto evolutionary algorithm. TIK-report, vol. 103 (2001)"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1007\/978-3-540-30217-9_84","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"E Zitzler","year":"2004","unstructured":"Zitzler, E., K\u00fcnzli, S.: Indicator-based selection in multiobjective search. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832\u2013842. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_84"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.ins.2018.10.013","volume":"476","author":"X Chu","year":"2019","unstructured":"Chu, X., Cai, F., Cui, C.: Adaptive recommendation model using meta-learning for population-based algorithms. Inf. Sci. 476, 192\u2013210 (2019)","journal-title":"Inf. Sci."},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.neucom.2016.04.027","volume":"205","author":"J Kanda","year":"2016","unstructured":"Kanda, J., De Carvalho, A., Hruschka, E.: Meta-learning to select the best meta-heuristic for the traveling salesman problem: a comparison of meta-features. Neurocomputing 205, 393\u2013406 (2016)","journal-title":"Neurocomputing"},{"key":"31_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73263-1","volume-title":"Metalearning: Applications to Data Mining","author":"P Brazdil","year":"2008","unstructured":"Brazdil, P., Carrier, C.G., Soares, C.: Metalearning: Applications to Data Mining. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-73263-1"},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-36182-0_14","volume-title":"Discovery Science","author":"Y Peng","year":"2002","unstructured":"Peng, Y., Flach, P.A., Soares, C., Brazdil, P.: Improved dataset characterisation for meta-learning. In: Lange, S., Satoh, K., Smith, C.H. (eds.) DS 2002. LNCS, vol. 2534, pp. 141\u2013152. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36182-0_14"},{"issue":"1","key":"31_CR16","first-page":"31","volume":"1","author":"R Vilalta","year":"2004","unstructured":"Vilalta, R., Giraud-Carrier, C.G., Brazdil, P.: Using meta-learning to support data mining. Int. J. Comput. Sci. Appl. 1(1), 31\u201345 (2004)","journal-title":"Int. J. Comput. Sci. Appl."},{"key":"31_CR17","first-page":"1","volume":"21","author":"E Alcobaca","year":"2020","unstructured":"Alcobaca, E., Siqueira, F., Rivolli, A.: MFE: towards reproducible meta-feature extraction. J. Mach. Learn. Res. 21, 1\u20135 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"31_CR18","unstructured":"Rivolli, A., Garcia, L. P., Soares, C.: Towards reproducible empirical research in meta-learning, pp. 32\u201352 (2018)"},{"issue":"1","key":"31_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10044-012-0280-z","volume":"17","author":"M Reif","year":"2012","unstructured":"Reif, M., Shafait, F., Goldstein, M., Breuel, T., Dengel, A.: Automatic classifier selection for non-experts. Pattern Anal. Appl. 17(1), 83\u201396 (2012). https:\/\/doi.org\/10.1007\/s10044-012-0280-z","journal-title":"Pattern Anal. Appl."},{"key":"31_CR20","first-page":"8","volume":"105","author":"A Balte","year":"2014","unstructured":"Balte, A., Pise, N., Kulkarni, P.: Meta-learning with landmarking: a survey. Int. J. Comput. Appl. 105, 8 (2014)","journal-title":"Int. J. Comput. Appl."},{"key":"31_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-31753-3_18","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"F Pinto","year":"2016","unstructured":"Pinto, F., Soares, C., Mendes-Moreira, J.: Towards automatic generation of metafeatures. In: Bailey, J., Khan, L., Washio, T., Dobbie, G., Huang, J.Z., Wang, R. (eds.) PAKDD 2016. LNCS (LNAI), vol. 9651, pp. 215\u2013226. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31753-3_18"},{"issue":"1","key":"31_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.32614\/RJ-2017-004","volume":"9","author":"J Bossek","year":"2017","unstructured":"Bossek, J.: smoof: single-and multi-objective optimization test functions. R J. 9(1), 103 (2017)","journal-title":"R J."},{"issue":"2","key":"31_CR23","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TEVC.2016.2587749","volume":"21","author":"H Ishibuchi","year":"2017","unstructured":"Ishibuchi, H., Setoguchi, Y., Masuda, H.: Performance of decomposition-based many-objective algorithms strongly depends on pareto front shapes. IEEE Trans. Evol. Comput. 21(2), 169\u2013190 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"31_CR24","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.eswa.2015.10.021","volume":"46","author":"C Cui","year":"2016","unstructured":"Cui, C., Hu, M.Q., Weir, J.D.: A recommendation system for meta-modeling: a meta-learning based approach. Expert Syst. Appl. 46, 33\u201344 (2016)","journal-title":"Expert Syst. Appl."},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Tian, Y., Cheng, R., Zhang, X.: PlatEMO: a MATLAB platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput. Intell. Mag. 12(4), 73\u201387 (2017)","DOI":"10.1109\/MCI.2017.2742868"},{"issue":"3","key":"31_CR26","first-page":"137","volume":"19","author":"H Neave","year":"1990","unstructured":"Neave, H., Worthington, P.: Distribution-free tests. Contemp. Sociol. 19(3), 137\u2013153 (1990)","journal-title":"Contemp. Sociol."}],"container-title":["Communications in Computer and Information Science","Neural Computing for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-5188-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T23:15:05Z","timestamp":1629414905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-5188-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811651878","9789811651885"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-5188-5_31","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NCAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Computing for Advanced Applications","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ncaa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dl2link.com\/ncaa2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"144","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":"54","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":"38% - 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.07","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.62","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)"}}]}}