{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:12:46Z","timestamp":1778249566291,"version":"3.51.4"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031302282","type":"print"},{"value":"9783031302299","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30229-9_19","type":"book-chapter","created":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T19:02:39Z","timestamp":1680980559000},"page":"285-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["RF+clust for\u00a0Leave-One-Problem-Out Performance Prediction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6983-9627","authenticated-orcid":false,"given":"Ana","family":"Nikolikj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4981-3227","authenticated-orcid":false,"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7330-1902","authenticated-orcid":false,"given":"Tome","family":"Eftimov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,9]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Belkhir, N., Dr\u00e9o, J., Sav\u00e9ant, P., Schoenauer, M.: Per instance algorithm configuration of CMA-ES with limited budget. In: GECCO, pp. 681\u2013688 (2017)","DOI":"10.1145\/3071178.3071343"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s11749-016-0481-7","volume":"25","author":"G Biau","year":"2016","unstructured":"Biau, G., Scornet, E.: A random forest guided tour. TEST 25(2), 197\u2013227 (2016). https:\/\/doi.org\/10.1007\/s11749-016-0481-7","journal-title":"TEST"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Bischl, B., Mersmann, O., Trautmann, H., Preu\u00df, M.: Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, pp. 313\u2013320 (2012)","DOI":"10.1145\/2330163.2330209"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Cenikj, G., Lang, R.D., Engelbrecht, A.P., Doerr, C., Koro\u0161ec, P., Eftimov, T.: Selector: selecting a representative benchmark suite for reproducible statistical comparison. arXiv preprint arXiv:2204.11527 (2022)","DOI":"10.1145\/3512290.3528809"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Derbel, B., Liefooghe, A., V\u00e9rel, S., Aguirre, H., Tanaka, K.: New features for continuous exploratory landscape analysis based on the soo tree. In: FOGA, pp. 72\u201386 (2019)","DOI":"10.1145\/3299904.3340308"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Dietrich, K., Mersmann, O.: Increasing the diversity of benchmark function sets through affine recombination. In: Rudolph, G., Kononova, A.V., Aguirre, H., Kerschke, P., Ochoa, G., Tu\u0161ar, T. (eds.) International Conference on Parallel Problem Solving from Nature, pp. 590\u2013602. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14714-2_41","DOI":"10.1007\/978-3-031-14714-2_41"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Eftimov, T., Jankovic, A., Popovski, G., Doerr, C., Koro\u0161ec, P.: Personalizing performance regression models to black-box optimization problems. In: GECCO, pp. 669\u2013677 (2021)","DOI":"10.1145\/3449639.3459407"},{"key":"19_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116871","volume":"198","author":"T Eftimov","year":"2022","unstructured":"Eftimov, T., et al.: Less is more: Selecting the right benchmarking set of data for time series classification. Expert Syst. Appl. 198, 116871 (2022)","journal-title":"Expert Syst. Appl."},{"key":"19_CR9","unstructured":"Hansen, N., Auger, A., Finck, S., Ros, R.: Real-parameter black-box optimization benchmarking 2010: Experimental setup. Ph.D. thesis, INRIA (2010)"},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1080\/10556788.2020.1808977","volume":"36","author":"N Hansen","year":"2021","unstructured":"Hansen, N., Auger, A., Ros, R., Mersmann, O., Tu\u0161ar, T., Brockhoff, D.: COCO: a platform for comparing continuous optimizers in a black-box setting. Optim. Meth. Software 36(1), 114\u2013144 (2021)","journal-title":"Optim. Meth. Software"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Jankovic, A., Doerr, C.: Landscape-aware fixed-budget performance regression and algorithm selection for modular CMA-ES variants. In: GECCO, pp. 841\u2013849. ACM (2020)","DOI":"10.1145\/3377930.3390183"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Jankovic, A., Popovski, G., Eftimov, T., Doerr, C.: The impact of hyper-parameter tuning for landscape-aware performance regression and algorithm selection. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 687\u2013696 (2021)","DOI":"10.1145\/3449639.3459406"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Kerschke, P., Trautmann, H.: The r-package flacco for exploratory landscape analysis with applications to multi-objective optimization problems. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 5262\u20135269. IEEE (2016)","DOI":"10.1109\/CEC.2016.7748359"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Kostovska, A., et al.: Per-run algorithm selection with warm-starting using trajectory-based features. arXiv preprint arXiv:2204.09483 (2022)","DOI":"10.1007\/978-3-031-14714-2_4"},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"78","DOI":"10.3390\/a14030078","volume":"14","author":"RD Lang","year":"2021","unstructured":"Lang, R.D., Engelbrecht, A.P.: An exploratory landscape analysis-based benchmark suite. Algorithms 14(3), 78 (2021)","journal-title":"Algorithms"},{"key":"19_CR16","unstructured":"Liang, J.J., Qu, B.Y., Suganthan, P.N.: Problem definitions and evaluation criteria for the cec 2014 special session and competition on single objective real-parameter numerical optimization. Technical report Zhengzhou, China 635, 490 (2013)"},{"key":"19_CR17","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-41888-4_4","volume-title":"Recent Advances in the Theory and Application of Fitness Landscapes","author":"KM Malan","year":"2014","unstructured":"Malan, K.M., Engelbrecht, A.P.: Fitness landscape analysis for metaheuristic performance prediction. In: Richter, H., Engelbrecht, A. (eds.) Recent Advances in the Theory and Application of Fitness Landscapes. ECC, vol. 6, pp. 103\u2013132. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-41888-4_4"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory landscape analysis. In: GECCO, pp. 829\u2013836 (2011)","DOI":"10.1145\/2001576.2001690"},{"key":"19_CR19","unstructured":"Molnar, C.: Interpretable machine learning. Lulu. com (2020)"},{"key":"19_CR20","unstructured":"Nikolikj, A.: Rfclustgit (2023). https:\/\/github.com\/anikolik\/RF-clust"},{"key":"19_CR21","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Petelin, G., Cenikj, G., Eftimov, T.: Tla: Topological landscape analysis for single objective continuous optimization problem instances. In: 2022 IEEE Symposium Series on Computational Intelligence (SSCI). p. In Press. IEEE (2022)","DOI":"10.1109\/SSCI51031.2022.10022126"},{"key":"19_CR23","unstructured":"Rapin, J., Teytaud, O.: Nevergrad - A gradient-free optimization platform. https:\/\/GitHub.com\/FacebookResearch\/Nevergrad (2018)"},{"key":"19_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106138","volume":"90","author":"U \u0160kvorc","year":"2020","unstructured":"\u0160kvorc, U., Eftimov, T., Koro\u0161ec, P.: Understanding the problem space in single-objective numerical optimization using exploratory landscape analysis. Appl. Soft Comput. 90, 106138 (2020)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"432","DOI":"10.3390\/math10030432","volume":"10","author":"U \u0160kvorc","year":"2022","unstructured":"\u0160kvorc, U., Eftimov, T., Koro\u0161ec, P.: Transfer learning analysis of multi-class classification for landscape-aware algorithm selection. Mathematics 10(3), 432 (2022)","journal-title":"Mathematics"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s11047-020-09820-4","volume":"21","author":"J Stork","year":"2020","unstructured":"Stork, J., Eiben, A.E., Bartz-Beielstein, T.: A new taxonomy of global optimization algorithms. Natural Comput. 21, 219\u2013242 (2020). https:\/\/doi.org\/10.1007\/s11047-020-09820-4","journal-title":"Natural Comput."},{"issue":"4","key":"19_CR27","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Global Optim."},{"key":"19_CR28","doi-asserted-by":"publisher","first-page":"15197","DOI":"10.1109\/ACCESS.2017.2731992","volume":"5","author":"Q Xu","year":"2017","unstructured":"Xu, Q., Yang, Y., Liu, Y., Wang, X.: An improved Latin hypercube sampling method to enhance numerical stability considering the correlation of input variables. IEEE Access 5, 15197\u201315205 (2017)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30229-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T23:08:45Z","timestamp":1681081725000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30229-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031302282","9783031302299"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30229-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/evoapps\/","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":"78","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":"14","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":"47% - 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":"3","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)"}}]}}