{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:47:19Z","timestamp":1743151639716,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031746291"},{"type":"electronic","value":"9783031746307"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-74630-7_21","type":"book-chapter","created":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T04:27:50Z","timestamp":1738988870000},"page":"313-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Shapley-Based Feature Selection for\u00a0Online Algorithm Selection"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Becker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6988-6186","authenticated-orcid":false,"given":"Viktor","family":"Bengs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,8]]},"reference":[{"key":"21_CR1","unstructured":"Abbasi-Yadkori, Y., P\u00e1l, D., Szepesv\u00e1ri, C.: Improved algorithms for linear stochastic bandits. In: Advances in Neural Information Processing Systems (NeurIPS), vol.\u00a024, pp. 2312\u20132320 (2011)"},{"key":"21_CR2","unstructured":"Abe, N., Long, P.M.: Associative reinforcement learning using linear probabilistic concepts. In: Proceedings of the International Conference on Machine Learning (ICML), pp. 3\u201311 (1999)"},{"key":"21_CR3","unstructured":"Agrawal, S., Goyal, N.: Thompson sampling for contextual bandits with linear payoffs. In: Proceedings of the International Conference on Machine Learning (ICML), pp. 127\u2013135 (2013)"},{"issue":"4\u20135","key":"21_CR4","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. Theory Pract. Logic Program. 14(4\u20135), 509\u2013524 (2014)","journal-title":"Theory Pract. Logic Program."},{"key":"21_CR5","unstructured":"Auer, P.: Using confidence bounds for exploitation-exploration trade-offs. J. Mach. Learn. Res. 3(Nov), 397\u2013422 (2002)"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47, 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"21_CR7","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."},{"issue":"5","key":"21_CR8","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.cor.2008.04.004","volume":"36","author":"J Castro","year":"2009","unstructured":"Castro, J., G\u00f3mez, D., Tejada, J.: Polynomial calculation of the Shapley value based on sampling. Comput. Oper. Res. 36(5), 1726\u20131730 (2009)","journal-title":"Comput. Oper. Res."},{"key":"21_CR9","unstructured":"Chu, W., Li, L., Reyzin, L., Schapire, R.E.: Contextual bandits with linear payoff functions. In: Proceedings of International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 208\u2013214 (2011)"},{"issue":"7","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1162\/neco.2007.19.7.1939","volume":"19","author":"S Cohen","year":"2007","unstructured":"Cohen, S., Dror, G., Ruppin, E.: Feature selection via coalitional game theory. Neural Comput. 19(7), 1939\u20131961 (2007)","journal-title":"Neural Comput."},{"key":"21_CR11","unstructured":"Covert, I., Lundberg, S.M., Lee, S.I.: Understanding global feature contributions with additive importance measures. 33, 17212\u201317223 (2020)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Degroote, H.: Online algorithm selection. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 5173\u20135174 (2017)","DOI":"10.24963\/ijcai.2017\/746"},{"key":"21_CR13","unstructured":"Degroote, H., De\u00a0Causmaecker, P., Bischl, B., Kotthoff, L.: A regression-based methodology for online algorithm selection. In: Eleventh Annual Symposium on Combinatorial Search (2018)"},{"issue":"8","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.3390\/e23081094","volume":"23","author":"H Dong","year":"2021","unstructured":"Dong, H., Sun, J., Sun, X.: A multi-objective multi-label feature selection algorithm based on Shapley value. Entropy 23(8), 1094 (2021)","journal-title":"Entropy"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"144352","DOI":"10.1109\/ACCESS.2021.3119110","volume":"9","author":"D Fryer","year":"2021","unstructured":"Fryer, D., Str\u00fcmke, I., Nguyen, H.: Shapley values for feature selection: the good, the bad, and the axioms. IEEE Access 9, 144352\u2013144360 (2021)","journal-title":"IEEE Access"},{"issue":"3\u20134","key":"21_CR16","first-page":"295","volume":"47","author":"M Gagliolo","year":"2006","unstructured":"Gagliolo, M., Schmidhuber, J.: Learning dynamic algorithm portfolios. Ann. Math. Artif. Intell. 47(3\u20134), 295\u2013328 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"key":"21_CR17","doi-asserted-by":"publisher","unstructured":"Hart, S.: Shapley Value. In: Game Theory, pp. 210\u2013216. Springer (1989). https:\/\/doi.org\/10.1007\/978-1-349-20181-5_25","DOI":"10.1007\/978-1-349-20181-5_25"},{"key":"21_CR18","unstructured":"Hutter, F., Hoos, H., Leyton-Brown, K.: Bayesian optimization with censored response data. arXiv preprint arXiv:1310.1947 (2013)"},{"key":"21_CR19","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)","journal-title":"Artif. Intell."},{"issue":"1","key":"21_CR20","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."},{"issue":"4","key":"21_CR21","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. 26(4), 597\u2013620 (2018)","journal-title":"Evol. Comput."},{"key":"21_CR22","unstructured":"Kolpaczki, P., Bengs, V., H\u00fcllermeier, E.: Identifying top-k players in cooperative games via Shapley bandits. In: LWDA, pp. 133\u2013144 (2021)"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Kolpaczki, P., Bengs, V., H\u00fcllermeier, E.: Approximating the Shapley value without marginal contributions. arXiv preprint arXiv:2302.00736 (2023)","DOI":"10.1609\/aaai.v38i12.29225"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit Algorithms. Cambridge University Press (2020)","DOI":"10.1017\/9781108571401"},{"key":"21_CR25","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-030-65965-3_28","volume-title":"ECML PKDD 2020 Workshops","author":"C Molnar","year":"2020","unstructured":"Molnar, C., Casalicchio, G., Bischl, B.: Interpretable machine learning \u2013 a brief history, state-of-the-art and challenges. In: Koprinska, I., Kamp, M., Appice, A., Loglisci, C., Antonie, L., Zimmermann, A., Guidotti, R., \u00d6zg\u00f6bek, \u00d6., Ribeiro, R.P., Gavald\u00e0, R., Gama, J., Adilova, L., Krishnamurthy, Y., Ferreira, P.M., Malerba, D., Medeiros, I., Ceci, M., Manco, G., Masciari, E., Ras, Z.W., Christen, P., Ntoutsi, E., Schubert, E., Zimek, A., Monreale, A., Biecek, P., Rinzivillo, S., Kille, B., Lommatzsch, A., Gulla, J.A. (eds.) ECML PKDD 2020. CCIS, vol. 1323, pp. 417\u2013431. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65965-3_28"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Rice, J.R.: The algorithm selection problem. In: Advances in Computers, vol.\u00a015, pp. 65\u2013118. Elsevier (1976)","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Shapley, L.S.: A value for n-person games. In: Classics in Game Theory, vol. 69 (1997)","DOI":"10.2307\/j.ctv173f1fh.12"},{"key":"21_CR28","volume-title":"The Shapley value: Essays in honor of Lloyd S","author":"LS Shapley","year":"1988","unstructured":"Shapley, L.S., Roth, A.E.: The Shapley value: Essays in honor of Lloyd S. Cambridge University Press, Shapley (1988)"},{"issue":"3\u20134","key":"21_CR29","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/biomet\/25.3-4.285","volume":"25","author":"WR Thompson","year":"1933","unstructured":"Thompson, W.R.: On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3\u20134), 285\u2013294 (1933)","journal-title":"Biometrika"},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Tornede, A., Bengs, V., H\u00fcllermeier, E.: Machine learning for online algorithm selection under censored feedback. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a036, pp. 10370\u201310380 (2022)","DOI":"10.1609\/aaai.v36i9.21279"},{"key":"21_CR31","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"},{"key":"21_CR32","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 (ACML), pp. 737\u2013752 (2020)"},{"key":"21_CR33","doi-asserted-by":"crossref","unstructured":"Tripathi, S., Hemachandra, N., Trivedi, P.: Interpretable feature subset selection: a Shapley value based approach. In: 2020 IEEE International Conference on Big Data (Big Data), pp. 5463\u20135472. IEEE (2020)","DOI":"10.1109\/BigData50022.2020.9378102"},{"key":"21_CR34","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"21_CR35","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Hydra-MIP: automated algorithm configuration and selection for mixed integer programming. In: RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI), pp. 16\u201330 (2011)"}],"container-title":["Communications in Computer and Information Science","Machine Learning and Principles and Practice of Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74630-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T04:28:18Z","timestamp":1738988898000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74630-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031746291","9783031746307"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74630-7_21","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"8 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}