{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T16:38:47Z","timestamp":1792168727310,"version":"4.4.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T00:00:00Z","timestamp":1568073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,9,10]]},"DOI":"10.1145\/3298689.3346956","type":"proceedings-article","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T13:21:31Z","timestamp":1568208091000},"page":"574-575","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Bandit algorithms in recommender systems"],"prefix":"10.1145","author":[{"given":"Dorota","family":"Glowacka","sequence":"first","affiliation":[{"name":"University of Helsinki"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,9,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806609"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2678025.2701401"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2856767.2856786"},{"key":"e_1_3_2_1_4_1","first-page":"397","article-title":"Using confidence bounds for exploitation-exploration trade-offs","author":"Auer P.","year":"2002","unstructured":"P. Auer . 2002 . Using confidence bounds for exploitation-exploration trade-offs . Journal of Machine Learning Research 3 , Nov (2002), 397 -- 422 . P. Auer. 2002. Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research 3, Nov (2002), 397--422.","journal-title":"Journal of Machine Learning Research 3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_6_1","unstructured":"Olivier Chapelle and Lihong Li. 2011. An empirical evaluation of thompson sampling. In Advances in neural information processing systems. 2249--2257.   Olivier Chapelle and Lihong Li. 2011. An empirical evaluation of thompson sampling. In Advances in neural information processing systems . 2249--2257."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2856767.2856803"},{"key":"e_1_3_2_1_8_1","volume-title":"Int. Symp. Op. Res. 77--84","author":"Dorard Louis","year":"2009","unstructured":"Louis Dorard , Dorota Glowacka , and John Shawe-Taylor . 2009 . Gaussian process modelling of dependencies in multi-armed bandit problems . In Int. Symp. Op. Res. 77--84 . Louis Dorard, Dorota Glowacka, and John Shawe-Taylor. 2009. Gaussian process modelling of dependencies in multi-armed bandit problems. In Int. Symp. Op. Res. 77--84."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2732158.2732189"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3305381.3305511"},{"key":"e_1_3_2_1_11_1","volume-title":"International Conference on Machine Learning. 757--765","author":"Gentile Claudio","year":"2014","unstructured":"Claudio Gentile , Shuai Li , and Giovanni Zappella . 2014 . Online clustering of bandits . In International Conference on Machine Learning. 757--765 . Claudio Gentile, Shuai Li, and Giovanni Zappella. 2014. Online clustering of bandits. In International Conference on Machine Learning. 757--765."},{"key":"e_1_3_2_1_12_1","series-title":"Series B (Methodological)","volume-title":"Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society","author":"Gittins John C","year":"1979","unstructured":"John C Gittins . 1979. Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society . Series B (Methodological) ( 1979 ), 148--177. John C Gittins. 1979. Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society. Series B (Methodological) (1979), 148--177."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3121050.3121108"},{"key":"e_1_3_2_1_14_1","volume-title":"Bandit Algorithms in Information Retrieval. Foundations and Trends\u00ae in Information Retrieval 13, 4","author":"Glowacka Dorota","year":"2019","unstructured":"Dorota Glowacka . 2019. Bandit Algorithms in Information Retrieval. Foundations and Trends\u00ae in Information Retrieval 13, 4 ( 2019 ), 299--424. Dorota Glowacka. 2019. Bandit Algorithms in Information Retrieval. Foundations and Trends\u00ae in Information Retrieval 13, 4 (2019), 299--424."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2449396.2449413"},{"key":"e_1_3_2_1_16_1","volume-title":"International Workshop on Symbiotic Interaction. Springer, 121--126","author":"Hore Sayantan","year":"2015","unstructured":"Sayantan Hore , Lasse Tyrvainen , Joel Pyykko , and Dorota Glowacka . 2015 . A reinforcement learning approach to query-less image retrieval . In International Workshop on Symbiotic Interaction. Springer, 121--126 . Sayantan Hore, Lasse Tyrvainen, Joel Pyykko, and Dorota Glowacka. 2015. A reinforcement learning approach to query-less image retrieval. In International Workshop on Symbiotic Interaction. Springer, 121--126."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2678025.2701371"},{"key":"e_1_3_2_1_18_1","unstructured":"K. Konyushkova and D. Glowacka. 2013. Content-based image retrieval with hierarchical Gaussian Process bandits with self-organizing maps. In ESANN.  K. Konyushkova and D. Glowacka. 2013. Content-based image retrieval with hierarchical Gaussian Process bandits with self-organizing maps. In ESANN ."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.12.076"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935878"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911548"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911455"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3025171.3025205"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273587"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3231593"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767863"},{"key":"e_1_3_2_1_28_1","volume-title":"Gaussian process optimization in the bandit setting: No regret and experimental design. arXiv preprint arXiv:0912.3995","author":"Srinivas Niranjan","year":"2009","unstructured":"Niranjan Srinivas , Andreas Krause , Sham M Kakade , and Matthias Seeger . 2009. Gaussian process optimization in the bandit setting: No regret and experimental design. arXiv preprint arXiv:0912.3995 ( 2009 ). Niranjan Srinivas, Andreas Krause, Sham M Kakade, and Matthias Seeger. 2009. Gaussian process optimization in the bandit setting: No regret and experimental design. arXiv preprint arXiv:0912.3995 (2009)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645733"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741104"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983847"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/3298483.3298627"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623372"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911528"}],"event":{"name":"RecSys '19: Thirteenth ACM Conference on Recommender Systems","location":"Copenhagen Denmark","acronym":"RecSys '19"},"container-title":["Proceedings of the 13th ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3298689.3346956","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3298689.3346956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:15Z","timestamp":1750204395000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3298689.3346956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,10]]},"references-count":34,"alternative-id":["10.1145\/3298689.3346956","10.1145\/3298689"],"URL":"https:\/\/doi.org\/10.1145\/3298689.3346956","relation":{},"subject":[],"published":{"date-parts":[[2019,9,10]]},"assertion":[{"value":"2019-09-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}