{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T10:08:39Z","timestamp":1787652519592,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030581114","type":"print"},{"value":"9783030581121","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58112-1_4","type":"book-chapter","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:04:30Z","timestamp":1599062670000},"page":"48-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem"],"prefix":"10.1007","author":[{"given":"Moritz","family":"Seiler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Janina","family":"Pohl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakob","family":"Bossek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pascal","family":"Kerschke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heike","family":"Trautmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Alissa, M., Sim, K., Hart, E.: Algorithm selection using deep learning without feature extraction. In: Proceedings of the Genetic and Evolutionary Computation Conference GECCO 2019, pp. 198\u2013206. Association for Computing Machinery, New York (2019). \nhttps:\/\/doi.org\/10.1145\/3321707.3321845","DOI":"10.1145\/3321707.3321845"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.artint.2016.04.003","volume":"237","author":"B Bischl","year":"2016","unstructured":"Bischl, B., et al.: ASlib: a benchmark library for algorithm selection. Artif. Intell. 237, 41\u201358 (2016). \nhttps:\/\/doi.org\/10.1016\/j.artint.2016.04.003","journal-title":"Artif. Intell."},{"issue":"170","key":"4_CR3","first-page":"1","volume":"17","author":"B Bischl","year":"2016","unstructured":"Bischl, B., et al.: mlr: machine learning in R. J. Mach. Learn. Res. (JMLR) 17(170), 1\u20135 (2016). \nhttp:\/\/jmlr.org\/papers\/v17\/15-066.html","journal-title":"J. Mach. Learn. Res. (JMLR)"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Bischl, B., Mersmann, O., Trautmann, H., Preuss, M.: Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 313\u2013320. ACM, July 2012. \nhttps:\/\/doi.org\/10.1145\/2330163.2330209\n\n. \nhttp:\/\/dl.acm.org\/citation.cfm?doid=2330163.2330209","DOI":"10.1145\/2330163.2330209"},{"key":"4_CR5","unstructured":"Bossek, J.: Salesperson: computation of instance features and R interface to the state-of-the-art exact and inexact solvers for the traveling salesperson problem (2017). \nhttps:\/\/github.com\/jakobbossek\/salesperson\n\n. R package version 1.0.0"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., Trautmann, H.: Evolving diverse TSP instances by means of novel and creative mutation operators. In: Friedrich, T., Doerr, C., Arnold, D. (eds.) Proceedings of the 15th ACM\/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA XV), pp. 58\u201371. ACM, Potsdam (2019)","DOI":"10.1145\/3299904.3340307"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-319-50349-3_4","volume-title":"Learning and Intelligent Optimization","author":"J Bossek","year":"2016","unstructured":"Bossek, J., Trautmann, H.: Evolving instances for maximizing performance differences of state-of-the-art inexact TSP solvers. In: Festa, P., Sellmann, M., Vanschoren, J. (eds.) LION 2016. LNCS, vol. 10079, pp. 48\u201359. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-50349-3_4"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-49130-1_1","volume-title":"AI*IA 2016 Advances in Artificial Intelligence","author":"J Bossek","year":"2016","unstructured":"Bossek, J., Trautmann, H.: Understanding characteristics of evolved instances for state-of-the-art inexact TSP solvers with maximum performance difference. In: Adorni, G., Cagnoni, S., Gori, M., Maratea, M. (eds.) AI*IA 2016. LNCS (LNAI), vol. 10037, pp. 3\u201312. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-49130-1_1"},{"key":"4_CR9","unstructured":"Chen, T., et al.: XGBoost: extreme gradient boosting (2019). \nhttps:\/\/CRAN.R-project.org\/package=xgboost\n\n. R package version 0.90.0.2"},{"key":"4_CR10","unstructured":"Glorot, X., Bordes, A., Bengio, Y.: Deep sparse rectifier neural networks. In: Gordon, G.J., Dunson, D.B., Dud\u00edk, M. (eds.) Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2011, Fort Lauderdale, USA, 11\u201313 April 2011. JMLR Proceedings, vol. 15, pp. 315\u2013323. JMLR.org (2011). \nhttp:\/\/proceedings.mlr.press\/v15\/glorot11a\/glorot11a.pdf"},{"key":"4_CR11","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-35488-8_1","volume-title":"Feature Extraction","author":"I Guyon","year":"2006","unstructured":"Guyon, I., Elisseeff, A.: An introduction to feature extraction. In: Guyon, I., Nikravesh, M., Gunn, S., Zadeh, L.A. (eds.) Feature Extraction. STUDFUZZ, vol. 207, pp. 1\u201325. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/978-3-540-35488-8_1"},{"key":"4_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45171-7","volume-title":"Applied Multivariate Statistical Analysis","author":"WK H\u00e4rdle","year":"2015","unstructured":"H\u00e4rdle, W.K., Simar, L.: Applied Multivariate Statistical Analysis, 4th edn. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-45171-7","edition":"4"},{"key":"4_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, Heidelberg (2009). \nhttp:\/\/www.springer.com\/de\/book\/9780387848570"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the lin-kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014). \nhttps:\/\/doi.org\/10.1016\/j.artint.2013.10.003","journal-title":"Artif. Intell."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. J. (AIJ) 206, 79\u2013111 (2014). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0004370213001082","journal-title":"Artif. Intell. J. (AIJ)"},{"issue":"9","key":"4_CR17","first-page":"1","volume":"11","author":"A Karatzoglou","year":"2004","unstructured":"Karatzoglou, A., Smola, A., Hornik, K., Zeileis, A.: kernlab - An S4 package for kernel methods in R. J. Stat. Softw. (JSS) 11(9), 1\u201320 (2004). \nhttp:\/\/www.jstatsoft.org\/v11\/i09\/","journal-title":"J. Stat. Softw. (JSS)"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Kerschke, P., Bossek, J., Trautmann, H.: Parameterization of state-of-the-art performance indicators: a robustness study based on inexact TSP solvers. In: Proceedings of the 20th Genetic and Evolutionary Computation Conference (GECCO) Companion, pp. 1737\u20131744. ACM, Kyoto (2018). \nhttps:\/\/doi.org\/10.1145\/3205651.3208233\n\n. \nhttp:\/\/doi.acm.org\/10.1145\/3205651.3208233","DOI":"10.1145\/3205651.3208233"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco_a_00242","volume":"27","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Hoos, H.H., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evol. Comput. (ECJ) 27(1), 3\u201345 (2019)","journal-title":"Evol. Comput. (ECJ)"},{"issue":"4","key":"4_CR20","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1162\/evco_a_00215","volume":"26","author":"P Kerschke","year":"2018","unstructured":"Kerschke, P., Kotthoff, L., Bossek, J., Hoos, H.H., Trautmann, H.: Leveraging TSP solver complementarity through machine learning. Evol. Comput. (ECJ) 26(4), 597\u2013620 (2018)","journal-title":"Evol. Comput. (ECJ)"},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1162\/evco_a_00236","volume":"27","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Trautmann, H.: Automated algorithm selection on continuous black-box problems by combining exploratory landscape analysis and machine learning. Evol. Comput. 27(1), 99\u2013127 (2019). \nhttps:\/\/doi.org\/10.1162\/evco_a_00236\n\n. pMID: 30365386","journal-title":"Evol. Comput."},{"key":"4_CR22","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: Bengio, Y., LeCun, Y. (eds.) 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, 7\u20139 May 2015, Conference Track Proceedings (2015). \nhttp:\/\/arxiv.org\/abs\/1412.6980"},{"issue":"1\u20132","key":"4_CR23","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R Kohavi","year":"1997","unstructured":"Kohavi, R., John, G.H., et al.: Wrappers for feature subset selection. Artif. Intell. 97(1\u20132), 273\u2013324 (1997)","journal-title":"Artif. Intell."},{"issue":"3","key":"4_CR24","doi-asserted-by":"publisher","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). \nhttps:\/\/doi.org\/10.1609\/aimag.v35i3.2460\n\n. \nhttps:\/\/aaai.org\/ojs\/index.php\/aimagazine\/article\/view\/2460","journal-title":"AI Mag."},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-19084-6_18","volume-title":"Learning and Intelligent Optimization","author":"L Kotthoff","year":"2015","unstructured":"Kotthoff, L., Kerschke, P., Hoos, H., Trautmann, H.: Improving the state of the art in inexact TSP solving using per-instance algorithm selection. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 202\u2013217. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-19084-6_18"},{"key":"4_CR26","unstructured":"LeCun, Y., Bengio, Y., et al.: Convolutional networks for images, speech, and time series. In: The Handbook of Brain Theory and Neural Networks, vol. 3361, no. 10, p. 1995 (1995)"},{"issue":"3","key":"4_CR27","first-page":"18","volume":"2","author":"A Liaw","year":"2002","unstructured":"Liaw, A., Wiener, M.: Classification and regression by randomForest. R News 2(3), 18\u201322 (2002). \nhttps:\/\/cran.r-project.org\/doc\/Rnews\/Rnews2002-3.pdf","journal-title":"R News"},{"key":"4_CR28","unstructured":"Lin, M., Chen, Q., Yan, S.: Network in network. In: Bengio, Y., LeCun, Y. (eds.) 2nd International Conference on Learning Representations, ICLR 2014, Banff, AB, Canada, 14\u201316 April 2014, Conference Track Proceedings (2014). \nhttp:\/\/arxiv.org\/abs\/1312.4400"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Lindauer, T.M., Hoos, H.H., Hutter, F., Schaub, T.: AutoFolio: an automatically configured algorithm selector (extended abstract). In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 5025\u20135029, August 2017. \nhttps:\/\/doi.org\/10.24963\/ijcai.2017\/715\n\n. \nhttps:\/\/www.ijcai.org\/proceedings\/2017\/715","DOI":"10.24963\/ijcai.2017\/715"},{"key":"4_CR30","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: Rossi, F. (ed.) Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI), vol. 13, pp. 608\u2013614. Association for the Advancement of Artificial Intelligence (AAAI), August 2013. \nhttps:\/\/www.aaai.org\/ocs\/index.php\/IJCAI\/IJCAI13\/paper\/view\/6946"},{"issue":"1","key":"4_CR31","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"HB Mann","year":"1947","unstructured":"Mann, H.B., Whitney, D.R.: On a test of whether one of two random variables is stochastically larger than the other. Ann. Math. Stat. 18(1), 50\u201360 (1947). \nhttps:\/\/doi.org\/10.1214\/aoms\/1177730491","journal-title":"Ann. Math. Stat."},{"key":"4_CR32","doi-asserted-by":"publisher","unstructured":"Mannor, S., Peleg, D., Rubinstein, R.Y.: The cross entropy method for classification. In: Raedt, L.D., Wrobel, S. (eds.) Machine Learning, Proceedings of the Twenty-Second International Conference (ICML 2005), Bonn, Germany, 7\u201311 August 2005. ACM International Conference Proceeding Series, vol. 119, pp. 561\u2013568. ACM (2005). \nhttps:\/\/doi.org\/10.1145\/1102351.1102422","DOI":"10.1145\/1102351.1102422"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-34413-8_9","volume-title":"Learning and Intelligent Optimization","author":"O Mersmann","year":"2012","unstructured":"Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., Neumann, F.: Local search and the traveling salesman problem: a feature-based characterization of problem hardness. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, pp. 115\u2013129. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-34413-8_9"},{"issue":"2","key":"4_CR34","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10472-013-9341-2","volume":"69","author":"O Mersmann","year":"2013","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., Neumann, F.: A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. Ann. Math. Artif. Intell. 69(2), 151\u2013182 (2013). \nhttps:\/\/doi.org\/10.1007\/s10472-013-9341-2\n\n. \nhttps:\/\/link.springer.com\/article\/10.1007\/s10472-013-9341-2","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"4_CR35","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata, Y., Kobayashi, S.: A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J. Comput. 25(2), 346\u2013363 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"8","key":"4_CR36","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","volume":"27","author":"H Peng","year":"2005","unstructured":"Peng, H., Long, F., Ding, C.: Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy. IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI) 27(8), 1226\u20131238 (2005). \nhttps:\/\/doi.org\/10.1109\/TPAMI.2005.159\n\n. \nhttps:\/\/ieeexplore.ieee.org\/abstract\/document\/1453511","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI)"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Pihera, J., Musliu, N.: Application of machine learning to algorithm selection for TSP. In: 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, 10\u201312 November 2014, pp. 47\u201354. IEEE Computer Society (2014)","DOI":"10.1109\/ICTAI.2014.18"},{"issue":"4","key":"4_CR38","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"4_CR39","doi-asserted-by":"publisher","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). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0065245808605203","journal-title":"Adv. Comput."},{"issue":"01","key":"4_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218213017600065","volume":"26","author":"M Rizzini","year":"2017","unstructured":"Rizzini, M., Fawcett, C., Vallati, M., Gerevini, A.E., Hoos, H.H.: Static and dynamic portfolio methods for optimal planning: an empirical analysis. Int. J. Artif. Intell. Tools 26(01), 1\u201327 (2017). \nhttps:\/\/doi.org\/10.1142\/S0218213017600065\n\n. \nhttps:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213017600065","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"4_CR41","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"4_CR42","unstructured":"Ross, P., Schulenburg, S., Mar\u00edn-Bl\u00e4zquez, J.G., Hart, E.: Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. In: Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation GECCO 2002, pp. 942\u2013948. Morgan Kaufmann Publishers Inc., San Francisco (2002)"},{"key":"4_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-32964-7_35","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"K Sim","year":"2012","unstructured":"Sim, K., Hart, E., Paechter, B.: A hyper-heuristic classifier for one dimensional bin packing problems: improving classification accuracy by attribute evolution. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012. LNCS, vol. 7492, pp. 348\u2013357. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-32964-7_35"},{"issue":"1","key":"4_CR44","first-page":"1929","volume":"15","author":"N Srivastava","year":"2014","unstructured":"Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.: Dropout: a simple way to prevent neural networks from overfitting. J. Mach. Learn. Res. 15(1), 1929\u20131958 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR45","unstructured":"Therneau, T., Atkinson, B.: rpart: recursive partitioning and regression trees (2019). \nhttps:\/\/CRAN.R-project.org\/package=rpart\n\n. R package version 4.1-15"},{"key":"4_CR46","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jbi.2018.07.014","volume":"85","author":"RJ Urbanowicz","year":"2018","unstructured":"Urbanowicz, R.J., Meeker, M., La Cava, W., Olson, R.S., Moore, J.H.: Relief-based feature selection: introduction and review. J. Biomed. Inform. 85, 189\u2013203 (2018). \nhttps:\/\/doi.org\/10.1016\/j.jbi.2018.07.014\n\n. \nhttps:\/\/www.sciencedirect.com\/science\/article\/pii\/S1532046418301400","journal-title":"J. Biomed. Inform."},{"issue":"3","key":"4_CR47","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/s11263-019-01198-w","volume":"128","author":"Y Wu","year":"2020","unstructured":"Wu, Y., He, K.: Group normalization. Int. J. Comput. Vis. 128(3), 742\u2013755 (2020). \nhttps:\/\/doi.org\/10.1007\/s11263-019-01198-w","journal-title":"Int. J. Comput. Vis."},{"key":"4_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-31612-8_18","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"L Xu","year":"2012","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Evaluating component solver contributions to portfolio-based algorithm selectors. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 228\u2013241. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31612-8_18"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58112-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:14:25Z","timestamp":1599063265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58112-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581114","9783030581121"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58112-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"31 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"268","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":"99","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":"37% - 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":"2.2","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)"}}]}}