{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T06:15:13Z","timestamp":1790662513832,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T00:00:00Z","timestamp":1509926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1618948"],"award-info":[{"award-number":["IIS-1618948"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,11,6]]},"DOI":"10.1145\/3132847.3133025","type":"proceedings-article","created":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T13:30:29Z","timestamp":1509975029000},"page":"1927-1936","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":54,"title":["Returning is Believing"],"prefix":"10.1145","author":[{"given":"Qingyun","family":"Wu","sequence":"first","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongning","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liangjie","family":"Hong","sequence":"additional","affiliation":[{"name":"Etsy Inc. & Yahoo Research, Brooklyn, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yue","family":"Shi","sequence":"additional","affiliation":[{"name":"Yahoo Research & Facebook, Sunnyvale, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,11,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Improved Algorithms for Linear Stochastic Bandits. In NIPS '11","author":"Yasin","year":"2011"},{"key":"e_1_3_2_1_2_1","first-page":"397","article-title":"Using Confidence Bounds for Exploitation-Exploration Tradeo's","volume":"3","author":"Auer Peter","year":"2002","journal-title":"JMLR"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_4_1","unstructured":"P. Auer N. Cesa-Bianchi Y. Freund and R. E. Schapire. 1995. Gambling in a rigged casino: The adversarial multi-armed bandit problem. In 36th FOCS. 322--331.   P. Auer N. Cesa-Bianchi Y. Freund and R. E. Schapire. 1995. Gambling in a rigged casino: The adversarial multi-armed bandit problem. In 36th FOCS. 322--331."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883092"},{"key":"e_1_3_2_1_6_1","unstructured":"Nicolo Cesa-Bianchi Claudio Gentile and Giovanni Zappella. 2013. A gang of bandits. (2013) 737--745.   Nicolo Cesa-Bianchi Claudio Gentile and Giovanni Zappella. 2013. A gang of bandits. (2013) 737--745."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623634"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242610"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939875"},{"key":"e_1_3_2_1_10_1","volume-title":"Time-Sensitive Recommendation From Recurrent User Activities. In NIPS '15","author":"Du Nan","year":"2015"},{"key":"e_1_3_2_1_11_1","unstructured":"Sarah Filippi Olivier Cappe Aurelien Garivier and Csaba Szepesvari. 2010. Parametric bandits: The generalized linear case. In NIPS. 586--594.   Sarah Filippi Olivier Cappe Aurelien Garivier and Csaba Szepesvari. 2010. Parametric bandits: The generalized linear case. In NIPS. 586--594."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"J. Giffins K. Glazebrook and R. Weber. 2011. Multi-armed Bandit Allocation Indices. John Wiley & Sons.  J. Giffins K. Glazebrook and R. Weber. 2011. Multi-armed Bandit Allocation Indices. John Wiley & Sons.","DOI":"10.1002\/9780470980033"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622737.1622748"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684822.2685306"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623348"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2788581"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.2200\/S00605ED1V01Y201410ICR038"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935878"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684822.2685311"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90282-0"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.v59:6"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"e_1_3_2_1_25_1","unstructured":"Alex Strehl John Langford Lihong Li and Sham M Kakade. 2010. Learning from logged implicit exploration data. In NIPS. 2217--2225.   Alex Strehl John Langford Lihong Li and Sham M Kakade. 2010. Learning from logged implicit exploration data. In NIPS. 2217--2225."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/421425"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911528"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645724"}],"event":{"name":"CIKM '17: ACM Conference on Information and Knowledge Management","location":"Singapore Singapore","acronym":"CIKM '17","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 2017 ACM on Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3132847.3133025","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3132847.3133025","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3132847.3133025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:47Z","timestamp":1750212827000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3132847.3133025"}},"subtitle":["Optimizing Long-term User Engagement in Recommender Systems"],"short-title":[],"issued":{"date-parts":[[2017,11,6]]},"references-count":28,"alternative-id":["10.1145\/3132847.3133025","10.1145\/3132847"],"URL":"https:\/\/doi.org\/10.1145\/3132847.3133025","relation":{},"subject":[],"published":{"date-parts":[[2017,11,6]]},"assertion":[{"value":"2017-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}