{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:10:34Z","timestamp":1742983834136,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030375980"},{"type":"electronic","value":"9783030375997"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-37599-7_27","type":"book-chapter","created":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T14:02:43Z","timestamp":1578060163000},"page":"321-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Active Matrix Completion for Algorithm Selection"],"prefix":"10.1007","author":[{"given":"Mustafa","family":"M\u0131s\u0131r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","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":"27_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"27_CR3","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). MIT Press","journal-title":"Evol. Comput."},{"key":"27_CR4","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."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.artint.2016.04.003","volume":"237","author":"B Bischl","year":"2017","unstructured":"Bischl, B., et al.: ASlib: a benchmark library for algorithm selection. Artif. Intell. 237, 41\u201358 (2017)","journal-title":"Artif. Intell."},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1155\/2009\/421425","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":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-10172-9_5","volume-title":"Business Process Management","author":"J Ribeiro","year":"2014","unstructured":"Ribeiro, J., Carmona, J., M\u0131s\u0131r, M., Sebag, M.: A recommender system for process discovery. In: Sadiq, S., Soffer, P., V\u00f6lzer, H. (eds.) BPM 2014. LNCS, vol. 8659, pp. 67\u201383. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10172-9_5"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Zhou, J., Balasubramanian, V., Panchanathan, S., Davidson, I., Ye, J.: Active matrix completion. In: The 13th IEEE ICDM, pp. 81\u201390 (2013)","DOI":"10.1109\/ICDM.2013.69"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Ruchansky, N., Crovella, M., Terzi, E.: Matrix completion with queries. In: Proceedings of the 21th ACM SIGKDD KDD, pp. 1025\u20131034 (2015)","DOI":"10.1145\/2783258.2783259"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"M\u0131s\u0131r, M.: Data sampling through collaborative filtering for algorithm selection. In: the 16th IEEE CEC, pp. 2494\u20132501 (2017)","DOI":"10.1109\/CEC.2017.7969608"},{"issue":"1","key":"27_CR11","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., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32(1), 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-642-34413-8_23","volume-title":"Learning and Intelligent Optimization","author":"X Yun","year":"2012","unstructured":"Yun, X., Epstein, S.L.: Learning algorithm portfolios for parallel execution. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, pp. 323\u2013338. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34413-8_23"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Beham, A., Affenzeller, M., Wagner, S.: Instance-based algorithm selection on quadratic assignment problem landscapes. In: ACM GECCO Comp, pp. 1471\u20131478 (2017)","DOI":"10.1145\/3067695.3082513"},{"key":"27_CR14","unstructured":"Vanschoren, J.: Meta-learning: a survey. arXiv preprint arXiv:1810.03548 (2018)"},{"key":"27_CR15","unstructured":"Stephenson, M., Renz, J.: Creating a hyper-agent for solving angry birds levels. In: AAAI AIIDE (2017)"},{"key":"27_CR16","unstructured":"Xu, L., Hutter, F., Shen, J., Hoos, H., Leyton-Brown, K.: SATzilla2012: improved algorithm selection based on cost-sensitive classification models. In: Proceedings of SAT Challenge 2012: Solver and Benchmark Descriptions, pp. 57\u201358 (2012)"},{"key":"27_CR17","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: The 23rd IJCAI, pp. 608\u2013614 (2013)"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Stern, D., Herbrich, R., Graepel, T., Samulowitz, H., Pulina, L., Tacchella, A.: Collaborative expert portfolio management. In: The 24th AAAI, pp. 179\u2013184 (2010)","DOI":"10.1609\/aaai.v24i1.7561"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Stern, D.H., Herbrich, R., Graepel, T.: Matchbox: large scale online Bayesian recommendations. In: The 18th ACM WWW, pp. 111\u2013120 (2009)","DOI":"10.1145\/1526709.1526725"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H., Leyton-Brown, K.: Hydra: automatically configuring algorithms for portfolio-based selection. In: The 24th AAAI, pp. 210\u2013216 (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"27_CR21","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC-instance-specific algorithm configuration. In: The 19th ECAI, pp. 751\u2013756 (2010)"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-642-23786-7_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"S Kadioglu","year":"2011","unstructured":"Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm selection and scheduling. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 454\u2013469. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23786-7_35"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Loreggia, A., Malitsky, Y., Samulowitz, H., Saraswat, V.A.: Deep learning for algorithm portfolios. In: The 13th AAAI, pp. 1280\u20131286 (2016)","DOI":"10.1609\/aaai.v30i1.10170"},{"key":"27_CR24","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1613\/jair.4726","volume":"53","author":"M Lindauer","year":"2015","unstructured":"Lindauer, M., Hoos, H.H., Hutter, F., Schaub, T.: AutoFolio: an automatically configured algorithm selector. JAIR 53, 745\u2013778 (2015)","journal-title":"JAIR"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Lindauer, M., van Rijn, J.N., Kotthoff, L.: The algorithm selection competitions 2015 and 2017. arXiv preprint arXiv:1805.01214 (2018)","DOI":"10.1016\/j.artint.2018.10.004"},{"key":"27_CR26","unstructured":"Kotthoff, L.: ICON challenge on algorithm selection. arXiv preprint arXiv:1511.04326 (2015)"},{"key":"27_CR27","unstructured":"Lindauer, M., van Rijn, J.N., Kotthoff, L.: Open algorithm selection challenge 2017: setup and scenarios. In: OASC 2017, pp. 1\u20137 (2017)"},{"key":"27_CR28","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-95104-1_13","volume-title":"Bioinspired Heuristics for Optimization","author":"F Gonard","year":"2019","unstructured":"Gonard, F., Schoenauer, M., Sebag, M.: Algorithm selector and prescheduler in the ICON challenge. In: Talbi, E.-G., Nakib, A. (eds.) Bioinspired Heuristics for Optimization. SCI, vol. 774, pp. 203\u2013219. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-95104-1_13"},{"key":"27_CR29","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96514-7","volume-title":"Hyper-Heuristics: Theory and Applications","author":"N Pillay","year":"2018","unstructured":"Pillay, N., Qu, R.: Hyper-Heuristics: Theory and Applications. Natural Computing Series. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96514-7"},{"key":"27_CR30","doi-asserted-by":"crossref","unstructured":"Da Costa, L., Fialho, A., Schoenauer, M., Sebag, M.: Adaptive operator selection with dynamic multi-armed bandits. In: GECCO, pp. 913\u2013920 (2008)","DOI":"10.1145\/1389095.1389272"},{"key":"27_CR31","unstructured":"Bennett, J., Lanning, S., et al.: The netflix prize. In: Proceedings of KDD Cup and Workshop, New York, NY, USA, vol. 2007, p. 35 (2007)"},{"issue":"8","key":"27_CR32","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30\u201337 (2009)","journal-title":"Computer"},{"key":"27_CR33","unstructured":"Salakhutdinov, R., Mnih, A.: Probabilistic matrix factorization. In: Platt, J.C., Koller, D., Singer, Y., Roweis, S.T. (eds.) The 21st NIPS, pp. 1257\u20131264 (2007)"},{"key":"27_CR34","unstructured":"Weimer, M., Karatzoglou, A., Le, Q.V., Smola, A.: CofiRank - maximum margin matrix factorization for collaborative ranking. In: The 21st NIPS, pp. 222\u2013230 (2007)"},{"key":"27_CR35","doi-asserted-by":"crossref","unstructured":"Shi, Y., Larson, M., Hanjalic, A.: List-wise learning to rank with matrix factorization for collaborative filtering. In: The 4th ACM RecSys, pp. 269\u2013272 (2010)","DOI":"10.1145\/1864708.1864764"},{"issue":"6","key":"27_CR36","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"EJ Candes","year":"2010","unstructured":"Candes, E.J., Plan, Y.: Matrix completion with noise. Proc. IEEE 98(6), 925\u2013936 (2010)","journal-title":"Proc. IEEE"},{"issue":"6","key":"27_CR37","first-page":"1336","volume":"25","author":"YX Wang","year":"2013","unstructured":"Wang, Y.X., Zhang, Y.J.: Nonnegative matrix factorization: a comprehensive review. IEEE TKDE 25(6), 1336\u20131353 (2013)","journal-title":"IEEE TKDE"},{"issue":"4","key":"27_CR38","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TPAMI.2013.226","volume":"36","author":"N Gillis","year":"2014","unstructured":"Gillis, N., Vavasis, S.A.: Fast and robust recursive algorithms for separable nonnegative matrix factorization. IEEE TPAMI 36(4), 698\u2013714 (2014)","journal-title":"IEEE TPAMI"},{"key":"27_CR39","doi-asserted-by":"crossref","unstructured":"Sutherland, D.J., P\u00f3czos, B., Schneider, J.: Active learning and search on low-rank matrices. In: Proceedings of the 19th ACM SIGKDD KDD, pp. 212\u2013220 (2013)","DOI":"10.1145\/2487575.2487627"},{"key":"27_CR40","first-page":"2287","volume":"11","author":"R Mazumder","year":"2010","unstructured":"Mazumder, R., Hastie, T., Tibshirani, R.: Spectral regularization algorithms for learning large incomplete matrices. JMLR 11, 2287\u20132322 (2010)","journal-title":"JMLR"},{"issue":"6","key":"27_CR41","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1093\/bioinformatics\/17.6.520","volume":"17","author":"O Troyanskaya","year":"2001","unstructured":"Troyanskaya, O., et al.: Missing value estimation methods for DNA microarrays. Bioinformatics 17(6), 520\u2013525 (2001)","journal-title":"Bioinformatics"},{"issue":"1","key":"27_CR42","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1002\/mpr.329","volume":"20","author":"MJ Azur","year":"2011","unstructured":"Azur, M.J., Stuart, E.A., Frangakis, C., Leaf, P.J.: Multiple imputation by chained equations: what is it and how does it work? Int. J. Methods Psych. Res. 20(1), 40\u201349 (2011)","journal-title":"Int. J. Methods Psych. Res."},{"key":"27_CR43","unstructured":"Gomes, C., Selman, B.: Algorithm portfolio design: theory vs. practice. In: The 13th UAI, pp. 190\u2013197 (1997)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37599-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,9]],"date-time":"2022-10-09T21:21:04Z","timestamp":1665350464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37599-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030375980","9783030375997"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37599-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siena","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2019.icas.xyz\/","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":"158","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":"64","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":"41% - 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":"5","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)"}}]}}