{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T07:30:34Z","timestamp":1778311834543,"version":"3.51.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319279251","type":"print"},{"value":"9783319279268","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27926-8_29","type":"book-chapter","created":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T10:31:17Z","timestamp":1451989877000},"page":"325-336","source":"Crossref","is-referenced-by-count":22,"title":["Bandits and Recommender Systems"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9mie","family":"Mary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romaric","family":"Gaudel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Preux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,6]]},"reference":[{"key":"29_CR1","unstructured":"Abbasi-yadkori, Y., Pal, D., Szepesvari, C.: Improved algorithms for linear stochastic bandits. In: Proceedings of NIPS, pp. 2312\u20132320 (2011)"},{"key":"29_CR2","unstructured":"Agarwal, D., Chen, B.-C., Elango, P., Motgi, N., Park, S.-T., Ramakrishnan, R., Roy, S., Zachariah, J.: Online models for content optimization. In: Proceedings of NIPS, pp. 17\u201324 (2008)"},{"key":"29_CR3","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":"29_CR4","unstructured":"Bennett, J., Lanning, S., Netflix, N.: The Netflix prize. In: KDD Cup and Workshop (2007)"},{"issue":"5","key":"29_CR5","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1016\/j.jcss.2012.01.001","volume":"78","author":"N Cesa-Bianchi","year":"2012","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Combinatorial bandits. J. Comput. Syst. Sci. 78(5), 1404\u20131422 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR6","unstructured":"Chatterjee, S.: Matrix estimation by universal singular value thresholding. pre-print (2012). http:\/\/arxiv.org\/abs\/1212.1247"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Dhanjal, C., Gaudel, R., Cl\u00e9men\u00e7on, S.: Collaborative filtering with localised ranking. In: Proceedings of AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9592"},{"key":"29_CR8","unstructured":"Dror, G., Koenigstein, N., Koren, Y., Weimer, M.: The Yahoo! music dataset and kdd-cup 2011. In: Proceedings of KDD Cup (2011)"},{"key":"29_CR9","unstructured":"Feldman, S.: Personalization with contextual bandits. http:\/\/engineering.richrelevance.com\/author\/sergey-feldman\/"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Kohli, P., Salek, M., Stoddard, G.: A fast bandit algorithm for recommendations to users with heterogeneous tastes. In: Proceedings of AAAI, pp. 1135\u20131141 (2013)","DOI":"10.1609\/aaai.v27i1.8463"},{"issue":"8","key":"29_CR11","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":"29_CR12","doi-asserted-by":"crossref","unstructured":"Langford, J., Strehl, A., Wortman, J.: Exploration scavenging. In: Proceedings of ICML, pp. 528\u2013535. Omnipress (2008)","DOI":"10.1145\/1390156.1390223"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Li, L., Chu, W., Langford, J., Schapire, R.E.: A contextual-bandit approach to personalized news article recommendation. In: Proceedings of WWW, pp. 661\u2013670. ACM, New York (2010)","DOI":"10.1145\/1772690.1772758"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Li, L., Chu, W., Langford, J., Wang, X.: Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms. In: Proceedings of WSDM, pp. 297\u2013306. ACM (2011)","DOI":"10.1145\/1935826.1935878"},{"key":"29_CR15","unstructured":"Mary, J., Garivier, A., Li, L., Munos, R., Nicol, O., Ortner, R., Preux, P.: ICML exploration and exploitation 3 - new challenges (2012)"},{"key":"29_CR16","first-page":"1265","volume":"6","author":"G Shani","year":"2005","unstructured":"Shani, G., Heckerman, D., Brafman, R.I.: An MDP-based recommender system. J. Mach. Learn. Res. 6, 1265\u20131295 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"29_CR17","unstructured":"Shivaswamy, P.K., Joachims, T.: Online learning with preference feedback. In: NIPS Workshop on Choice Models and Preference Learning (2011)"},{"key":"29_CR18","unstructured":"Walsh, T.J., Szita, I., Diuk, C., Littman, M.L.: Exploring compact reinforcement-learning representations with linear regression (2012). CoRR abs\/1205.2606"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Weston, J., Yee, H., Weiss, R.J.: Learning to rank recommendations with the k-order statistic loss. In: Proceedings of RecSys, pp. 245\u2013248. ACM (2013)","DOI":"10.1145\/2507157.2507210"},{"key":"29_CR20","volume-title":"Bandit Algorithms for Website Optimization","author":"JM White","year":"2012","unstructured":"White, J.M.: Bandit Algorithms for Website Optimization. O\u2019Reilly, USA (2012)"},{"key":"29_CR21","unstructured":"Yue, Y., Hong, S.A., Guestrin, C.: Hierarchical exploration for accelerating contextual bandits. In: Proceedings of ICML, pp. 1895\u20131902 (2012)"},{"key":"29_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-68880-8_32","volume-title":"Algorithmic Aspects in Information and Management","author":"Y Zhou","year":"2008","unstructured":"Zhou, Y., Wilkinson, D., Schreiber, R., Pan, R.: Large-scale parallel collaborative filtering for the netflix prize. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 337\u2013348. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Big Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27926-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T11:10:16Z","timestamp":1692184216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27926-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319279251","9783319279268"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27926-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}