{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:38:07Z","timestamp":1742927887875,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687582"},{"type":"electronic","value":"9783319687599"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68759-9_77","type":"book-chapter","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T22:33:42Z","timestamp":1507847622000},"page":"939-948","source":"Crossref","is-referenced-by-count":2,"title":["Recommending PSO Variants Using Meta-Learning Framework for Global Optimization"],"prefix":"10.1007","author":[{"given":"Xianghua","family":"Chu","sequence":"first","affiliation":[]},{"given":"Fulin","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Jiansheng","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Li","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"key":"77_CR1","doi-asserted-by":"crossref","unstructured":"Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Sixth International Symposium on Micro Machine and Human Science, pp. 39\u201343 (1995)","DOI":"10.1109\/MHS.1995.494215"},{"key":"77_CR2","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, vol. 4, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"77_CR3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"77_CR4","doi-asserted-by":"crossref","unstructured":"Brazdil, P.: Metalearning: Applications to Data Mining. Cognitive Technologies (2009)","DOI":"10.1007\/978-3-540-73263-1"},{"key":"77_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"77_CR6","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K.A.: Towards insightful algorithm selection for optimisation using meta-learning concepts. In: IEEE International Joint Conference on Neural Networks, pp. 4118\u20134124 (2008)","DOI":"10.1109\/IJCNN.2008.4634391"},{"key":"77_CR7","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.neucom.2016.04.027","volume":"205","author":"J Kanda","year":"2016","unstructured":"Kanda, J., Carvalho, A.D., Hruschka, E., Soares, C., Brazdil, P.: 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":"77_CR8","doi-asserted-by":"crossref","unstructured":"Bischl, B., Mersmann, O., Trautmann, H., Preu, M.: Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In: Conference on Genetic and Evolutionary Computation, pp. 313\u2013320 (2012)","DOI":"10.1145\/2330163.2330209"},{"key":"77_CR9","doi-asserted-by":"crossref","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C.: Exploratory landscape analysis. In: Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2011, Dublin, Ireland, July, pp. 829\u2013836 (2011)","DOI":"10.1145\/2001576.2001690"},{"key":"77_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-32937-1_23","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"MA Mu\u00f1oz","year":"2012","unstructured":"Mu\u00f1oz, M.A., Kirley, M., Halgamuge, S.K.: A meta-learning prediction model of algorithm performance for continuous optimization problems. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012. LNCS, vol. 7491, pp. 226\u2013235. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-32937-1_23"},{"key":"77_CR11","doi-asserted-by":"crossref","unstructured":"Malan, K.M., Engelbrecht, A.P.: Particle swarm optimisation failure prediction based on fitness landscape characteristics. In: IEEE Symposium on Swarm Intelligence, pp. 1\u20139 (2014)","DOI":"10.1109\/SIS.2014.7011789"},{"key":"77_CR12","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.ins.2015.05.010","volume":"317","author":"MA Mu\u00f1oz","year":"2015","unstructured":"Mu\u00f1oz, M.A., Sun, Y., Kirley, M., Halgamuge, S.K.: Algorithm selection for black-box continuous optimization problems: a survey on methods and challenges. Inf. Sci. 317, 224\u2013245 (2015)","journal-title":"Inf. Sci."},{"key":"77_CR13","unstructured":"Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.-P., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL report (2005)"},{"key":"77_CR14","doi-asserted-by":"crossref","unstructured":"Shi, Y., Eberhart, R.: Modified particle swarm optimizer. In: IEEE World Congress on Computational Intelligence, pp. 69\u201373 (1998)","DOI":"10.1109\/ICEC.1998.699146"},{"key":"77_CR15","first-page":"1671","volume":"20","author":"M Clerc","year":"2002","unstructured":"Clerc, M., Kennedy, J.: The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 20, 1671\u20131676 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"77_CR16","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Mendes, R.: Population structure and particle swarm performance. In: Proceedings of the 2002 Congress on Evolutionary Computation, pp. 1671\u20131676 (2002)","DOI":"10.1109\/CEC.2002.1004493"},{"key":"77_CR17","unstructured":"Parsopoulos, K.E., Vrahatis, M.N.: A unified particle swarm optimization scheme. In: International Conference of Computational Methods in Sciences and Engineering, pp. 221\u2013226 (2004)"},{"key":"77_CR18","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/TEVC.2005.857610","volume":"10","author":"JJ Liang","year":"2006","unstructured":"Liang, J.J., Qin, A.K., Suganthan, P.N., Baskar, S.: Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans. Evol. Comput. 10, 281\u2013295 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"77_CR19","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2004.826069","volume":"8","author":"VDB Frans","year":"2004","unstructured":"Frans, V.D.B., Engelbrecht, A.P.: A cooperative approach to particle swarm optimization. IEEE Trans. Evol. Comput. 8, 225\u2013239 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"77_CR20","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/j.asoc.2014.11.006","volume":"27","author":"T Liao","year":"2014","unstructured":"Liao, T., Molina, D., Tzle, T.: Performance evaluation of automatically tuned continuous optimizers on different benchmark sets. Appl. Soft Comput. 27, 490\u2013503 (2014)","journal-title":"Appl. Soft Comput."},{"key":"77_CR21","doi-asserted-by":"crossref","unstructured":"Auger, A., Hansen, N.: Performance evaluation of an advanced local search evolutionary algorithm. In: The 2005 IEEE Congress on Evolutionary Computation, vol. 2, pp. 1777\u20131784 (2005)","DOI":"10.1109\/CEC.2005.1554903"},{"key":"77_CR22","unstructured":"Romero, C., Olmo, J.L., Ventura, S.: A meta-learning approach for recommending a subset of white-box classification algorithms for Moodle datasets. In: Educational Data Mining (2013)"},{"key":"77_CR23","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10994-013-5387-y","volume":"93","author":"Q Sun","year":"2013","unstructured":"Sun, Q., Pfahringer, B.: Pairwise meta-rules for better meta-learning-based algorithm ranking. Mach. Learn. 93, 141\u2013161 (2013)","journal-title":"Mach. Learn."},{"key":"77_CR24","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.eswa.2015.10.021","volume":"46","author":"C Cui","year":"2015","unstructured":"Cui, C., Hu, M., Weir, J.D., Wu, T.: A recommendation system for meta-modeling: a meta-learning based approach. Expert Syst. Appl. 46, 33\u201344 (2015)","journal-title":"Expert Syst. Appl."},{"key":"77_CR25","doi-asserted-by":"crossref","unstructured":"Lunacek, M., Whitley, D.: The dispersion metric and the CMA evolution strategy. In: Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2006, Seattle, Washington, USA, July, pp. 477\u2013484 (2006)","DOI":"10.1145\/1143997.1144085"},{"key":"77_CR26","unstructured":"Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: International Conference on Genetic Algorithms, pp. 184\u2013192 (1995)"},{"key":"77_CR27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1214\/aoms\/1177729885","volume":"21","author":"FE Grubbs","year":"1950","unstructured":"Grubbs, F.E.: Sample criteria for testing outlying observations. Ann. Math. Stat. 21, 27\u201358 (1950)","journal-title":"Ann. Math. Stat."},{"key":"77_CR28","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.ins.2014.12.044","volume":"301","author":"DG Ferrari","year":"2015","unstructured":"Ferrari, D.G., Castro, L.N.D.: Clustering algorithm selection by meta-learning systems: a new distance-based problem characterization and ranking combination methods. Inf. Sci. 301, 181\u2013194 (2015)","journal-title":"Inf. Sci."},{"key":"77_CR29","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/A:1021713901879","volume":"50","author":"PB Brazdil","year":"2003","unstructured":"Brazdil, P.B., Soares, C., Costa, J.P.D.: Ranking learning algorithms: using IBL and meta-learning on accuracy and time results. Mach. Learn. 50, 251\u2013277 (2003)","journal-title":"Mach. Learn."},{"key":"77_CR30","doi-asserted-by":"crossref","first-page":"488","DOI":"10.2307\/2072534","volume":"19","author":"HR Neave","year":"1990","unstructured":"Neave, H.R., Worthington, P.L.: Distribution-free tests. Contemp. Sociol. 19, 488 (1990)","journal-title":"Contemp. Sociol."},{"key":"77_CR31","unstructured":"Matala, A.: Sample Size Requierement for Monte Carlo\u2013Simulations Using Latin Hypercube Sampling. Helsinki University of Technology, Espoo (2008)"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68759-9_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T12:19:18Z","timestamp":1570191558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68759-9_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687582","9783319687599"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68759-9_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}