{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:37:22Z","timestamp":1743046642953,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030757618"},{"type":"electronic","value":"9783030757625"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75762-5_13","type":"book-chapter","created":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T09:07:43Z","timestamp":1620464863000},"page":"152-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1231-4985","authenticated-orcid":false,"given":"Jonas","family":"Hanselle","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2415-2186","authenticated-orcid":false,"given":"Alexander","family":"Tornede","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9782-6818","authenticated-orcid":false,"given":"Marcel","family":"Wever","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9944-4108","authenticated-orcid":false,"given":"Eyke","family":"H\u00fcllermeier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,9]]},"reference":[{"issue":"4\u20135","key":"13_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1017\/S1471068414000179","volume":"14","author":"R Amadini","year":"2014","unstructured":"Amadini, R., Gabbrielli, M., Mauro, J.: SUNNY: a lazy portfolio approach for constraint solving. Theor. Pract. Log. Prog. 14(4\u20135), 509\u2013524 (2014)","journal-title":"Theor. Pract. Log. Prog."},{"key":"13_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)","journal-title":"Artif. Intell."},{"unstructured":"Cabannes, V., Rudi, A., Bach, F.: Structured prediction with partial labelling through the infimum loss. In: Proceedings of ICML, International Conference on Machine Learning (2020)","key":"13_CR3"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10994-017-5683-z","volume":"107","author":"K Eggensperger","year":"2017","unstructured":"Eggensperger, K., Lindauer, M., Hoos, H.H., Hutter, F., Leyton-Brown, K.: Efficient benchmarking of algorithm configurators via model-based surrogates. Mach. Learn. 107(1), 15\u201341 (2017). https:\/\/doi.org\/10.1007\/s10994-017-5683-z","journal-title":"Mach. Learn."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-02538-9_7","volume-title":"Experimental Methods for the Analysis of Optimization Algorithms","author":"M Gagliolo","year":"2010","unstructured":"Gagliolo, M., Legrand, C.: Algorithm survival analysis. In: Bartz-Beielstein, T., Chiarandini, M., Paquete, L., Preuss, M. (eds.) Experimental Methods for the Analysis of Optimization Algorithms, pp. 161\u2013184. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-02538-9_7"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10472-006-9036-z","volume":"47","author":"M Gagliolo","year":"2006","unstructured":"Gagliolo, M., Schmidhuber, J.: Leaning dynamic algorithm portfolios. Ann. Math. Artif. Intell. 47, 295\u2013328 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0017434","volume-title":"Principles and Practice of Constraint Programming-CP97","author":"CP Gomes","year":"1997","unstructured":"Gomes, C.P., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 121\u2013135. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0017434"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-58285-2_5","volume-title":"KI 2020: Advances in Artificial Intelligence","author":"J Hanselle","year":"2020","unstructured":"Hanselle, J., Tornede, A., Wever, M., H\u00fcllermeier, E.: Hybrid ranking and regression for algorithm selection. In: Schmid, U., Kl\u00fcgl, F., Wolter, D. (eds.) KI 2020. LNCS (LNAI), vol. 12325, pp. 59\u201372. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58285-2_5"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-319-23525-7_16","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"E H\u00fcllermeier","year":"2015","unstructured":"H\u00fcllermeier, E., Cheng, W.: Superset learning based on generalized loss minimization. In: Appice, A., Rodrigues, P.P., Santos Costa, V., Gama, J., Jorge, A., Soares, C. (eds.) ECML PKDD 2015. LNCS (LNAI), vol. 9285, pp. 260\u2013275. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23525-7_16"},{"unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Bayesian optimization with censored response data. In: NIPS Workshop on Bayesian Optimization, Sequential Experimental Design, and Bandits (2011)","key":"13_CR10"},{"issue":"7","key":"13_CR11","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.ijar.2013.09.003","volume":"55","author":"E H\u00fcllermeier","year":"2014","unstructured":"H\u00fcllermeier, E.: Learning from imprecise and fuzzy observations: data disambiguation through generalized loss minimization. Int. J. Approx. Reason. 55(7), 1519\u20131534 (2014). Special issue: Harnessing the information contained in low-quality data sources","journal-title":"Int. J. Approx. Reason."},{"unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC - instance-specific algorithm configuration. In: ECAI (2010)","key":"13_CR12"},{"issue":"1","key":"13_CR13","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. 27(1), 3\u201345 (2019)","journal-title":"Evol. Comput."},{"unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, 7\u20139 May 2015. Conference Track Proceedings (2015)","key":"13_CR14"},{"key":"13_CR15","series-title":"Statistics for Biology and Health","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6646-9","volume-title":"Survival Analysis","author":"DG Kleinbaum","year":"2012","unstructured":"Kleinbaum, D.G., Klein, M.: Survival Analysis. Survival Analysis, vol. 3. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4419-6646-9"},{"unstructured":"Kotthoff, L.: Hybrid regression-classification models for algorithm selection. In: ECAI, pp. 480\u2013485 (2012)","key":"13_CR16"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-319-50349-3_20","volume-title":"Learning and Intelligent Optimization","author":"M Lindauer","year":"2016","unstructured":"Lindauer, M., Bergdoll, R.-D., Hutter, F.: An empirical study of per-instance algorithm scheduling. In: Festa, P., Sellmann, M., Vanschoren, J. (eds.) LION 2016. LNCS, vol. 10079, pp. 253\u2013259. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50349-3_20"},{"unstructured":"Lobjois, L., Lema\u00eetre, M., et al.: Branch and bound algorithm selection by performance prediction. In: AAAI\/IAAI, pp. 353\u2013358 (1998)","key":"13_CR18"},{"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)","key":"13_CR19","DOI":"10.1109\/ICTAI.2014.18"},{"key":"13_CR20","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)","journal-title":"Adv. Comput."},{"issue":"4","key":"13_CR21","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1080\/00401706.1979.10489811","volume":"21","author":"J Schmee","year":"1979","unstructured":"Schmee, J., Hahn, G.J.: A simple method for regression analysis with censored data. Technometrics 21(4), 417\u2013432 (1979)","journal-title":"Technometrics"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-61527-7_21","volume-title":"Discovery Science","author":"A Tornede","year":"2020","unstructured":"Tornede, A., Wever, M., H\u00fcllermeier, E.: Extreme algorithm selection with dyadic feature representation. In: Appice, A., Tsoumakas, G., Manolopoulos, Y., Matwin, S. (eds.) DS 2020. LNCS (LNAI), vol. 12323, pp. 309\u2013324. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61527-7_21"},{"unstructured":"Tornede, A., Wever, M., H\u00fcllermeier, E.: Towards meta-algorithm selection. In: Workshop on Meta-Learning (MetaLearn 2020) @ NeurIPS 2020 (2020)","key":"13_CR23"},{"unstructured":"Tornede, A., Wever, M., Werner, S., Mohr, F., H\u00fcllermeier, E.: Run2survive: a decision-theoretic approach to algorithm selection based on survival analysis. In: Asian Conference on Machine Learning, pp. 737\u2013752. PMLR (2020)","key":"13_CR24"},{"unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Hydra-mip: automated algorithm configuration and selection for mixed integer programming. In: RCRA Workshop @ IJCAI (2011)","key":"13_CR25"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/978-3-540-74970-7_50","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L Xu","year":"2007","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: The design and analysis of an algorithm portfolio for SAT. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 712\u2013727. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_50"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75762-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:13:48Z","timestamp":1710350028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75762-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030757618","9783030757625"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75762-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2021.org\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"673","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":"157","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":"23% - 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":"7","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}