{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:56:17Z","timestamp":1743119777100,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"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_16","type":"book-chapter","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T22:33:42Z","timestamp":1507847622000},"page":"184-195","source":"Crossref","is-referenced-by-count":10,"title":["Matrix Factorization Based Benchmark Set Analysis: A Case Study on HyFlex"],"prefix":"10.1007","author":[{"given":"Mustafa","family":"M\u0131s\u0131r","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"issue":"8","key":"16_CR1","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren, Y., Bell, R., Volinsky, C., et al.: Matrix factorization techniques for recommender systems. Computer 42(8), 30\u201337 (2009)","journal-title":"Computer"},{"key":"16_CR2","first-page":"4","volume":"2009","author":"X Su","year":"2009","unstructured":"Su, X., Khoshgoftaar, T.M.: A survey of collaborative filtering techniques. Adv. Artif. Intell. 2009, 4 (2009)","journal-title":"Adv. Artif. Intell."},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.artint.2016.12.001","volume":"244","author":"M M\u0131s\u0131r","year":"2017","unstructured":"M\u0131s\u0131r, M., Sebag, M.: Alors: an algorithm recommender system. Artif. Intell. 244, 291\u2013314 (2017)","journal-title":"Artif. Intell."},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J Rice","year":"1976","unstructured":"Rice, J.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"issue":"5","key":"16_CR5","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF02163027","volume":"14","author":"GH Golub","year":"1970","unstructured":"Golub, G.H., Reinsch, C.: Singular value decomposition and least squares solutions. Numer. Math. 14(5), 403\u2013420 (1970)","journal-title":"Numer. Math."},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-29124-1_12","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"G Ochoa","year":"2012","unstructured":"Ochoa, G., et al.: HyFlex: a benchmark framework for cross-domain heuristic search. In: Hao, J.-K., Middendorf, M. (eds.) EvoCOP 2012. LNCS, vol. 7245, pp. 136\u2013147. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29124-1_12"},{"key":"16_CR7","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-1-4419-1665-5_15","volume-title":"Handbook of Metaheuristics","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 449\u2013468. Springer, Boston (2010)"},{"issue":"12","key":"16_CR8","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Qu, R.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"issue":"6","key":"16_CR9","doi-asserted-by":"crossref","first-page":"1796","DOI":"10.1109\/TPDS.2015.2462835","volume":"27","author":"S Chen","year":"2016","unstructured":"Chen, S., Li, Z., Yang, B., Rudolph, G.: Quantum-inspired hyper-heuristics for energy-aware scheduling on heterogeneous computing systems. IEEE Trans. Parallel Distrib. Syst. 27(6), 1796\u20131810 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"16_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-014-1688-1","volume":"239","author":"N Pillay","year":"2016","unstructured":"Pillay, N.: A review of hyper-heuristics for educational timetabling. Ann. Oper. Res. 239(1), 3\u201338 (2016)","journal-title":"Ann. Oper. Res."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Terashima-Marin, H., Mor\u00e1n-Saavedra, A., Ross, P.: Forming hyper-heuristics with gas when solving 2D-regular cutting stock problems. In: IEEE Congress on Evolutionary Computation (CEC), vol. 2, pp. 1104\u20131110. IEEE (2005)","DOI":"10.1109\/CEC.2005.1554814"},{"key":"16_CR12","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/978-3-319-47054-2_43","volume-title":"Nature-Inspired Design of Hybrid Intelligent Systems","author":"MA Sotelo-Figueroa","year":"2017","unstructured":"Sotelo-Figueroa, M.A., Soberanes, H.J.P., Carpio, J.M., Huacuja, H.J.F., Reyes, L.C., Alcaraz, J.A.S., Espinal, A.: Generating bin packing heuristic through grammatical evolution based on bee swarm optimization. In: Melin, P., Castillo, O., Kacprzyk, J. (eds.) Nature-Inspired Design of Hybrid Intelligent Systems. SCI, vol. 667, pp. 655\u2013671. Springer, Cham (2017). doi: 10.1007\/978-3-319-47054-2_43"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-79305-2_4","volume-title":"Artificial Evolution","author":"M Bader-El-Den","year":"2008","unstructured":"Bader-El-Den, M., Poli, R.: Generating SAT local-search heuristics using a GP hyper-heuristic framework. In: Monmarch\u00e9, N., Talbi, E.-G., Collet, P., Schoenauer, M., Lutton, E. (eds.) EA 2007. LNCS, vol. 4926, pp. 37\u201349. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-79305-2_4"},{"key":"16_CR14","series-title":"Intelligent Systems Reference Library","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-642-01799-5_6","volume-title":"Computational Intelligence","author":"EK Burke","year":"2009","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.R.: Exploring hyper-heuristic methodologies with genetic programming. In: Mumford, C.L., Jain, L.C. (eds.) Computational Intelligence. Intelligent Systems Reference Library, vol. 1, pp. 177\u2013201. Springer, Heidelberg (2009)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-45157-0_18","volume-title":"Practice and Theory of Automated Timetabling IV","author":"EK Burke","year":"2003","unstructured":"Burke, E.K., MacCarthy, B.L., Petrovic, S., Qu, R.: Knowledge discovery in a hyper-heuristic for course timetabling using case-based reasoning. In: Burke, E., De Causmaecker, P. (eds.) Practice and Theory of Automated Timetabling IV. LNCS, vol. 2740, pp. 276\u2013287. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-45157-0_18"},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.asoc.2014.12.012","volume":"28","author":"M Maashi","year":"2015","unstructured":"Maashi, M., Kendall, G., \u00d6zcan, E.: Choice function based hyper-heuristics for multi-objective optimization. Appl. Soft Comput. 28, 312\u2013326 (2015)","journal-title":"Appl. Soft Comput."},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-71231-2_14","volume-title":"Learning Classifier Systems","author":"JG Mar\u00edn-Bl\u00e1zquez","year":"2007","unstructured":"Mar\u00edn-Bl\u00e1zquez, J.G., Schulenburg, S.: A hyper-heuristic framework with XCS: learning to create novel problem-solving algorithms constructed from simpler algorithmic ingredients. In: Kovacs, T., Llor\u00e0, X., Takadama, K., Lanzi, P.L., Stolzmann, W., Wilson, S.W. (eds.) IWLCS 2003-2005. LNCS, vol. 4399, pp. 193\u2013218. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-71231-2_14"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"Practice and Theory of Automated Timetabling III","author":"P Cowling","year":"2001","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176\u2013190. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44629-X_11"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Da Costa, L., Fialho, A., Schoenauer, M., Sebag, M.: Adaptive operator selection with dynamic multi-armed bandits. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO), PP. 913\u2013920. Atlanta, Georgia, USA (2008)","DOI":"10.1145\/1389095.1389272"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Epitropakis, M.G., Caraffini, F., Neri, F., Burke, E.K.: A separability prototype for automatic memes with adaptive operator selection. In: IEEE Symposium on Foundations of Computational Intelligence (FOCI), PP. 70\u201377. IEEE (2014)","DOI":"10.1109\/FOCI.2014.7007809"},{"issue":"3","key":"16_CR21","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1609\/aimag.v35i3.2460","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag. 35(3), 48\u201360 (2014)","journal-title":"AI Mag."},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-30668-1_8","volume-title":"Genetic Programming","author":"J Park","year":"2016","unstructured":"Park, J., Mei, Y., Nguyen, S., Chen, G., Johnston, M., Zhang, M.: Genetic programming based hyper-heuristics for dynamic job shop scheduling: cooperative coevolutionary approaches. In: Heywood, M.I., McDermott, J., Castelli, M., Costa, E., Sim, K. (eds.) EuroGP 2016. LNCS, vol. 9594, pp. 115\u2013132. Springer, Cham (2016). doi: 10.1007\/978-3-319-30668-1_8"},{"key":"16_CR23","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/978-3-642-33021-6_28","volume-title":"Recent Advances on Hybrid Intelligent Systems","author":"M Sotelo-Figueroa","year":"2013","unstructured":"Sotelo-Figueroa, M., Soberanes, H., Carpio, J., Fraire Huacuja, H., Reyes, L., Soria Alcaraz, J.: Evolving bin packing heuristic using micro-differential evolution with indirect representation. In: Castillo, O., Melin, P., Kacprzyk, J. (eds.) Recent Advances on Hybrid Intelligent Systems, vol. 451, pp. 349\u2013359. Studies in Computational Intelligence. Springer, Heidelberg (2013)"},{"key":"16_CR24","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: IJCAI, vol. 91, pp. 331\u2013337 (1991)"},{"key":"16_CR25","first-page":"184","volume":"95","author":"T Jones","year":"1995","unstructured":"Jones, T., Forrest, S., et al.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. ICGA 95, 184\u2013192 (1995)","journal-title":"ICGA"},{"key":"16_CR26","unstructured":"Ruan, Y., Kautz, H.A., Horvitz, E.: The backdoor key: a path to understanding problem hardness. In: AAAI, vol. 4, pp. 118\u2013123 (2004)"},{"issue":"5","key":"16_CR27","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles, K., Lopes, L.: Measuring instance difficulty for combinatorial optimization problems. Comput. Oper. Res. 39(5), 875\u2013889 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"16_CR28","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/2594413.2594424","volume":"57","author":"K Leyton-Brown","year":"2014","unstructured":"Leyton-Brown, K., Hoos, H.H., Hutter, F., Xu, L.: Understanding the empirical hardness of NP-complete problems. Commun. ACM 57(5), 98\u2013107 (2014)","journal-title":"Commun. ACM"},{"issue":"4","key":"16_CR29","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1162\/evco.2006.14.4.433","volume":"14","author":"JI Hemert van","year":"2006","unstructured":"van Hemert, J.I.: Evolving combinatorial problem instances that are difficult to solve. Evol. Comput. 14(4), 433\u2013462 (2006)","journal-title":"Evol. Comput."},{"issue":"2","key":"16_CR30","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10472-011-9230-5","volume":"61","author":"K Smith-Miles","year":"2011","unstructured":"Smith-Miles, K., van Hemert, J.I.: Discovering the suitability of optimisation algorithms by learning from evolved instances. Ann. Math. Artif. Intell. 61(2), 87 (2011)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"16_CR31","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1287\/opre.2013.1169","volume":"61","author":"L Lopes","year":"2013","unstructured":"Lopes, L., Smith-Miles, K.: Generating applicable synthetic instances for branch problems. Oper. Res. 61(3), 563\u2013577 (2013)","journal-title":"Oper. Res."},{"key":"16_CR32","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.cor.2015.04.022","volume":"63","author":"K Smith-Miles","year":"2015","unstructured":"Smith-Miles, K., Bowly, S.: Generating new test instances by evolving in instance space. Comput. Oper. Res. 63, 102\u2013113 (2015)","journal-title":"Comput. Oper. Res."},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-50349-3_9","volume-title":"Learning and Intelligent Optimization","author":"Y Malitsky","year":"2016","unstructured":"Malitsky, Y., Merschformann, M., O\u2019Sullivan, B., Tierney, K.: Structure-preserving instance generation. In: Festa, P., Sellmann, M., Vanschoren, J. (eds.) LION 2016. LNCS, vol. 10079, pp. 123\u2013140. Springer, Cham (2016). doi: 10.1007\/978-3-319-50349-3_9"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K., Tan, T.T.: Measuring algorithm footprints in instance space. In: IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2012)","DOI":"10.1109\/CEC.2012.6252992"},{"key":"16_CR35","volume-title":"Principal Component Analysis","author":"I Jolliffe","year":"2002","unstructured":"Jolliffe, I.: Principal Component Analysis. Wiley Online Library, Hoboken (2002)"},{"key":"16_CR36","first-page":"119","volume":"4","author":"LK Saul","year":"2003","unstructured":"Saul, L.K., Roweis, S.T.: Think globally, fit locally: unsupervised learning of low dimensional manifolds. J. Mach. Learn. Res. 4, 119\u2013155 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"16_CR37","volume-title":"Finding Groups in Data: an Introduction to Cluster Analysis","author":"L Kaufman","year":"2009","unstructured":"Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: an Introduction to Cluster Analysis, vol. 344. John Wiley & Sons, Hoboken (2009)"},{"key":"16_CR38","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53\u201365 (1987)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"16_CR39","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"16_CR40","unstructured":"M\u0131s\u0131r, M.: Intelligent hyper-heuristics: a tool for solving generic optimisation problems. Ph.D. thesis, Department of Computer Science, KU Leuven (2012)"},{"key":"16_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-319-19084-6_6","volume-title":"Learning and Intelligent Optimization","author":"M M\u0131s\u0131r","year":"2015","unstructured":"M\u0131s\u0131r, M., Handoko, S.D., Lau, H.C.: OSCAR: online selection of algorithm portfolios with case study on memetic algorithms. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 59\u201373. Springer, Cham (2015). doi: 10.1007\/978-3-319-19084-6_6"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T12:18:21Z","timestamp":1570191501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68759-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687582","9783319687599"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68759-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}