{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:21:30Z","timestamp":1740108090576,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T00:00:00Z","timestamp":1652400000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T00:00:00Z","timestamp":1652400000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Grant No. 71971142","71701079"],"award-info":[{"award-number":["Grant No. 71971142","71701079"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00521-022-07302-5","type":"journal-article","created":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T17:02:55Z","timestamp":1652461375000},"page":"16255-16273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Empirical study on meta-feature characterization for multi-objective optimization problems"],"prefix":"10.1007","volume":"34","author":[{"given":"Xianghua","family":"Chu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuxiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yujuan","family":"Chai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuqiu","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,13]]},"reference":[{"issue":"1","key":"7302_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629474","volume":"9","author":"G Wang","year":"2014","unstructured":"Wang G, Song Q, Zhang X, Zhang K (2014) a generic multilabel learning-based classification algorithm recommendation method. Acm Trans Knowl Discov Data (TKDD) 9(1):1\u201330","journal-title":"Acm Trans Knowl Discov Data (TKDD)"},{"key":"7302_CR2","first-page":"25","volume-title":"The supervised learning no-free-lunch theorems. Soft computing and industry","author":"DH Wolpert","year":"2002","unstructured":"Wolpert DH (2002) The supervised learning no-free-lunch theorems. Soft computing and industry. Springer, London, pp 25\u201342"},{"key":"7302_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ins.2018.10.043","volume":"477","author":"BA Pimentel","year":"2019","unstructured":"Pimentel BA, Carvalho ACDE (2019) A new data characterization for selecting clustering algorithms using meta-learning. Inf Sci 477:203\u2013219","journal-title":"Inf Sci"},{"key":"7302_CR4","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.eswa.2018.10.036","volume":"118","author":"AE Gutierrez-Rodriguez","year":"2019","unstructured":"Gutierrez-Rodriguez AE, Conant-Pablos SE, Ortiz-Bayliss JC, Terashima-Marin H (2019) Selecting meta-heuristics for solving vehicle routing problems with time windows via meta-learning. Expert Syst Appl 118:470\u2013481","journal-title":"Expert Syst Appl"},{"issue":"6","key":"7302_CR5","first-page":"961","volume":"29","author":"ZL Zeng","year":"2014","unstructured":"Zeng ZL, Zhang HJ, Zhang R (2014) Summary of algorithm selection problem based on meta-learning. Control Dec 29(6):961\u2013968","journal-title":"Control Dec"},{"key":"7302_CR6","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.ins.2018.10.013","volume":"476","author":"XH Chu","year":"2019","unstructured":"Chu XH, Cai FL, Cui C, Hu MQ, Li L, Qin QD (2019) Adaptive recommendation model using meta-learning for population-based algorithms. Inf Sci 476:192\u2013210","journal-title":"Inf Sci"},{"key":"7302_CR7","first-page":"111:1","volume":"21","author":"E Alcoba\u00e7a","year":"2020","unstructured":"Alcoba\u00e7a E, Siqueira F, Rivolli A, Garcia LPF, Oliva JT, de Carvalho AC (2020) MFE: towards reproducible meta-feature extraction. J Mach Learn Res 21:111:1-111:5","journal-title":"J Mach Learn Res"},{"key":"7302_CR8","doi-asserted-by":"crossref","unstructured":"Filchenkov A, Pendryak A (2015) Datasets meta-feature description for recommending feature selection algorithm. In: 2015 Artificial intelligence and natural language and information extraction, social media and web search FRUCT conference (AINL-ISMW FRUCT). IEEE, pp 11\u201318","DOI":"10.1109\/AINL-ISMW-FRUCT.2015.7382962"},{"key":"7302_CR9","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, Soares C, Brazdil P (2016) Meta-learning to select the best meta-heuristic for the traveling salesman problem: a comparison of meta-features. Neurocomputing 205:393\u2013406","journal-title":"Neurocomputing"},{"key":"7302_CR10","doi-asserted-by":"publisher","first-page":"115589","DOI":"10.1016\/j.eswa.2021.115589","volume":"185","author":"ARS Parmezan","year":"2021","unstructured":"Parmezan ARS, Lee HD, Spola\u00f4r N, Wu FC (2021) Automatic recommendation of feature selection algorithms based on dataset characteristics. Expert Syst Appl 185:115589","journal-title":"Expert Syst Appl"},{"key":"7302_CR11","doi-asserted-by":"publisher","unstructured":"Gu QH, Wang Q, Xiong NN, Jiang S, Chen L (2021) Surrogate-assisted evolutionary algorithm for expensive constrained multi-objective discrete optimization problems. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-020-00249-x","DOI":"10.1007\/s40747-020-00249-x"},{"issue":"1","key":"7302_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00500-003-0328-5","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin Y (2005) A comprehensive survey of fitness approximation in evolutionary computation. Soft Comput 9(1):3\u201312","journal-title":"Soft Comput"},{"key":"7302_CR13","doi-asserted-by":"publisher","first-page":"3093","DOI":"10.1007\/s40747-021-00506-7","volume":"7","author":"JJ Xu","year":"2021","unstructured":"Xu JJ, Jin YC, Du WL (2021) A federated data-driven evolutionary algorithm for expensive multi-\/many-objective optimization. Complex Intell Syst 7:3093\u20133109","journal-title":"Complex Intell Syst"},{"issue":"2","key":"7302_CR14","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1109\/TCYB.2018.2869674","volume":"50","author":"HD Wang","year":"2020","unstructured":"Wang HD, Jin YC (2020) A random forest-assisted evolutionary algorithm for data-driven constrained multiobjective combinatorial optimization of trauma systems. IEEE Trans Cybern 50(2):536\u2013549","journal-title":"IEEE Trans Cybern"},{"key":"7302_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ins.2020.05.016","volume":"536","author":"H Lu","year":"2020","unstructured":"Lu H, Liu YX, Cheng S, Shi YH (2020) Adaptive online data-driven closed-loop parameter control strategy for swarm intelligence algorithm. Inf Sci 536:25\u201352","journal-title":"Inf Sci"},{"issue":"12","key":"7302_CR16","doi-asserted-by":"publisher","first-page":"8423","DOI":"10.1007\/s00521-019-04538-6","volume":"31","author":"X Chu","year":"2019","unstructured":"Chu X, Gao D, Chen J, Cui J, Cui C, Xu SX, Qin Q (2019) Adaptive differential search algorithm with multi-strategies for global optimization problems. Neural Comput Appl 31(12):8423\u20138440","journal-title":"Neural Comput Appl"},{"issue":"6","key":"7302_CR17","doi-asserted-by":"publisher","first-page":"1789","DOI":"10.1007\/s00521-018-3657-0","volume":"32","author":"X Chu","year":"2020","unstructured":"Chu X, Wu T, Weir JD, Shi Y, Niu B, Li L (2020) Learning\u2013interaction\u2013diversification framework for swarm intelligence optimizers: a unified perspective. Neural Comput Appl 32(6):1789\u20131809","journal-title":"Neural Comput Appl"},{"key":"7302_CR18","doi-asserted-by":"crossref","unstructured":"Rice JR (1976) The algorithm selection problem. In: Advances in computers. Elsevier, pp 65\u2013118","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"7302_CR19","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 MQ, Weir JD, Wu T (2016) A Recommendation model for meta-modeling: a meta-learning based approach. Expert Syst Appl 46:33\u201344","journal-title":"Expert Syst Appl"},{"key":"7302_CR20","doi-asserted-by":"publisher","first-page":"10262","DOI":"10.1109\/ACCESS.2020.2964726","volume":"8","author":"I Khan","year":"2020","unstructured":"Khan I, Zhang XC, Rehman M, Ali R (2020) A literature survey and empirical study of meta-learning for classifier selection. IEEE Access 8:10262\u201310281","journal-title":"IEEE Access"},{"issue":"8","key":"7302_CR21","first-page":"47","volume":"105","author":"A Balte","year":"2014","unstructured":"Balte A, Pise N, Kulkarni P (2014) Meta-learning with landmarking: a survey. Int J Comput Appl 105(8):47\u201351","journal-title":"Int J Comput Appl"},{"key":"7302_CR22","doi-asserted-by":"crossref","unstructured":"Castiello C, Castellano G, Fanelli AM (2005) Meta-data: characterization of input features for meta-learning. In: International conference on modeling decisions for artificial intelligence. Springer, Berlin, Heidelberg, pp 457\u2013468","DOI":"10.1007\/11526018_45"},{"key":"7302_CR23","doi-asserted-by":"crossref","unstructured":"Peng YH, Flach PA, Soares C, Brazdil P (2002) Improved dataset characterisation for meta-learning. In: International conference on discovery science. Springer, Berlin, Heidelberg, pp 141\u2013152","DOI":"10.1007\/3-540-36182-0_14"},{"key":"7302_CR24","doi-asserted-by":"publisher","first-page":"89675","DOI":"10.1109\/ACCESS.2021.3090936","volume":"9","author":"M Kotlar","year":"2021","unstructured":"Kotlar M, Punt M, Radivojevic Z, Cvetanovic M, Milutinovic V (2021) Novel meta-features for automated machine learning model selection in anomaly detection. IEEE Access 9:89675\u201389687","journal-title":"IEEE Access"},{"issue":"1","key":"7302_CR25","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10994-017-5681-1","volume":"107","author":"AC Lorena","year":"2018","unstructured":"Lorena AC, Maciel AI, de Miranda PBC, Costa IG, Prudencio RBC (2018) Data complexity meta-features for regression problems. Mach Learn 107(1):209\u2013246","journal-title":"Mach Learn"},{"key":"7302_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105682","volume":"195","author":"BA Pimentel","year":"2020","unstructured":"Pimentel BA, de Carvalho AC (2020) A meta-learning approach for recommending the number of clusters for clustering algorithms. Knowl Based Syst 195:105682","journal-title":"Knowl Based Syst"},{"key":"7302_CR27","unstructured":"Pfahringer B, Bensusan H, Giraud-Carrier CG (2000) Meta-learning by landmarking various learning algorithms. In: ICML, pp 743\u2013750"},{"key":"7302_CR28","volume-title":"Metalearning: applications to data mining","author":"P Brazdil","year":"2008","unstructured":"Brazdil P, Carrier CG, Soares C, Vilalta R (2008) Metalearning: applications to data mining. Springer, Berlin"},{"issue":"6","key":"7302_CR29","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"QF Zhang","year":"2007","unstructured":"Zhang QF, Li H (2007) MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"7302_CR30","doi-asserted-by":"crossref","unstructured":"Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: International conference on parallel problem solving from nature. Springer, Berlin, Heidelberg, pp 849\u2013858","DOI":"10.1007\/3-540-45356-3_83"},{"issue":"4","key":"7302_CR31","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 (2013) 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","journal-title":"IEEE Trans Evol Comput"},{"key":"7302_CR32","doi-asserted-by":"crossref","unstructured":"Zitzler E, Kunzli S (2004) Indicator-based selection in multiobjective search. In: International conference on parallel problem solving from nature. Springer, Berlin, Heidelberg, pp 832\u2013842","DOI":"10.1007\/978-3-540-30217-9_84"},{"key":"7302_CR33","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength Pareto evolutionary algorithm. TIK-report 103"},{"key":"7302_CR34","unstructured":"Zheng JH, Zou JH, Liu H (2017) Multi-objective evolutionary optimization. SARAP algorithm of multi-objective optimal capacity configuration for WT-PV-DE-BES Stand-Alone Microgrid"},{"issue":"3","key":"7302_CR35","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1162\/evco.1999.7.3.205","volume":"7","author":"K Deb","year":"1999","unstructured":"Deb K (1999) Multi-objective genetic algorithms: problem difficulties and construction of test problems. Evol Comput 7(3):205\u2013230","journal-title":"Evol Comput"},{"issue":"5","key":"7302_CR36","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, While L (2006) A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans Evol Comput 10(5):477\u2013506","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"7302_CR37","doi-asserted-by":"publisher","first-page":"5122","DOI":"10.1016\/j.ygeno.2020.09.020","volume":"112","author":"VK Singh","year":"2020","unstructured":"Singh VK, Maurya NS, Mani A, Yadav RS (2020) Machine learning method using position-specific mutation based classification outperforms one hot coding for disease severity prediction in haemophilia \u201cA.\u201d Genomics 112(6):5122\u20135128","journal-title":"Genomics"},{"issue":"2","key":"7302_CR38","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, Nojima Y (2017) Performance of decomposition-based many-objective algorithms strongly depends on Pareto front shapes. IEEE Trans Evol Comput 21(2):169\u2013190","journal-title":"IEEE Trans Evol Comput"},{"key":"7302_CR39","doi-asserted-by":"crossref","unstructured":"Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable test problems for evolutionary multi-objective optimization. In: Evolutionary multiobjective optimization. Springer, London, pp 105\u2013145","DOI":"10.1007\/1-84628-137-7_6"},{"issue":"2","key":"7302_CR40","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173\u2013195","journal-title":"Evol Comput"},{"issue":"12","key":"7302_CR41","doi-asserted-by":"publisher","first-page":"4108","DOI":"10.1109\/TCYB.2016.2600577","volume":"47","author":"R Cheng","year":"2017","unstructured":"Cheng R, Jin YC, Olhofer M, Sendhoff B (2017) Test problems for large-scale multiobjective and many-objective optimization. IEEE Trans Cybern 47(12):4108\u20134121","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"7302_CR42","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TEVC.2018.2836912","volume":"23","author":"S Zapotecas-Martinez","year":"2019","unstructured":"Zapotecas-Martinez S, Coello CAC, Aguirre HE, Tanaka K (2019) A review of features and limitations of existing scalable multiobjective test suites. IEEE Trans Evol Comput 23(1):130\u2013142","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"7302_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1456650.1456656","volume":"41","author":"KA Smith-Miles","year":"2008","unstructured":"Smith-Miles KA (2008) Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput Surv (CSUR) 41(1):1\u201325","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"4","key":"7302_CR44","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian Y, Cheng R, Zhang XY, Jin YC (2017) PlatEMO: a MATLAB platform for evolutionary multi-objective optimization. IEEE Comput Intell Mag 12(4):73\u201387","journal-title":"IEEE Comput Intell Mag"},{"issue":"4","key":"7302_CR45","first-page":"691","volume":"28","author":"G Wanka","year":"1999","unstructured":"Wanka G (1999) Multiobjective duality for the Markowitz portfolio optimization problem. Control Cybern 28(4):691\u2013702","journal-title":"Control Cybern"},{"key":"7302_CR46","doi-asserted-by":"crossref","unstructured":"Armananzas R, Lozano JA (2005) A multiobjective approach to the portfolio optimization problem. In: 2005 IEEE congress on evolutionary computation. IEEE, pp 1388\u20131395","DOI":"10.1109\/CEC.2005.1554852"},{"key":"7302_CR47","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/j.asoc.2014.08.026","volume":"24","author":"K Lwin","year":"2014","unstructured":"Lwin K, Qu R, Kendall G (2014) A learning-guided multi-objective evolutionary algorithm for constrained portfolio optimization. Appl Soft Comput 24:757\u2013772","journal-title":"Appl Soft Comput"},{"issue":"4","key":"7302_CR48","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MAT Figueiredo","year":"2007","unstructured":"Figueiredo MAT, Nowak RD, Wright SJ (2007) Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J Sel Top Signal Process 1(4):586\u2013597","journal-title":"IEEE J Sel Top Signal Process"},{"issue":"5","key":"7302_CR49","doi-asserted-by":"publisher","first-page":"1716","DOI":"10.1109\/TNNLS.2017.2677973","volume":"29","author":"H Li","year":"2018","unstructured":"Li H, Zhang QF, Deng JD, Xu ZB (2018) A preference-based multiobjective evolutionary approach for sparse optimization. IEEE Trans Neural Netw Learn Syst 29(5):1716\u20131731","journal-title":"IEEE Trans Neural Netw Learn Syst"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07302-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07302-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07302-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T23:04:02Z","timestamp":1663887842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07302-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,13]]},"references-count":49,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["7302"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07302-5","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2022,5,13]]},"assertion":[{"value":"29 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}