{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:28:19Z","timestamp":1775471299289,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,2,4]],"date-time":"2013-02-04T00:00:00Z","timestamp":1359936000000},"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":[[2013,2,4]]},"DOI":"10.1145\/2433396.2433419","type":"proceedings-article","created":{"date-parts":[[2013,2,5]],"date-time":"2013-02-05T13:19:52Z","timestamp":1360070392000},"page":"183-192","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":77,"title":["Reusing historical interaction data for faster online learning to rank for IR"],"prefix":"10.1145","author":[{"given":"Katja","family":"Hofmann","sequence":"first","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]},{"given":"Anne","family":"Schuth","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]},{"given":"Shimon","family":"Whiteson","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]},{"given":"Maarten","family":"de Rijke","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2013,2,4]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"17","volume-title":"NIPS'08","author":"Agarwal D.","year":"2008","unstructured":"D. Agarwal , B. Chen , P. Elango , N. Motgi , S. Park , R. Ramakrishnan , S. Roy , and J. Zachariah . Online models for content optimization . In NIPS'08 , pages 17 -- 24 , 2008 . D. Agarwal, B. Chen, P. Elango, N. Motgi, S. Park, R. Ramakrishnan, S. Roy, and J. Zachariah. Online models for content optimization. In NIPS'08, pages 17--24, 2008."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_3_1","first-page":"201","article-title":"Associative search network: A reinforcement learning associative memory","volume":"40","author":"Barto A. G.","year":"1981","unstructured":"A. G. Barto , R. S. Sutton , and P. S. Brouwer . Associative search network: A reinforcement learning associative memory . IEEE Trans. Syst., Man, and Cybern. , 40 : 201 -- 211 , 1981 . A. G. Barto, R. S. Sutton, and P. S. Brouwer. Associative search network: A reinforcement learning associative memory. IEEE Trans. Syst., Man, and Cybern., 40: 201--211, 1981.","journal-title":"IEEE Trans. Syst., Man, and Cybern."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2094072.2094078"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/2527652"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498818"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063618"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9197-9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398516"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_14_1","first-page":"79","volume-title":"Text Mining","author":"Joachims T.","year":"2003","unstructured":"T. Joachims . Evaluating retrieval performance using clickthrough data . In J. Franke, G. Nakhaeizadeh, and I. Renz, editors, Text Mining , pages 79 -- 96 . Physica\/Springer , 2003 . T. Joachims. Evaluating retrieval performance using clickthrough data. In J. Franke, G. Nakhaeizadeh, and I. Renz, editors, Text Mining, pages 79--96. Physica\/Springer, 2003."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390223"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935878"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_1_19_1","first-page":"759","volume-title":"ICML'00","author":"Precup D.","year":"2000","unstructured":"D. Precup , R. Sutton , and S. Singh . Eligibility traces for off-policy policy evaluation . In ICML'00 , pages 759 -- 766 , 2000 . D. Precup, R. Sutton, and S. Singh. Eligibility traces for off-policy policy evaluation. In ICML'00, pages 759--766, 2000."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835560"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458092"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000009"},{"key":"e_1_3_2_1_23_1","volume-title":"NIPS'99","author":"Schuurmans D.","year":"1999","unstructured":"D. Schuurmans . Greedy importance sampling . In NIPS'99 , 1999 . D. Schuurmans. Greedy importance sampling. In NIPS'99, 1999."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143956"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/551283"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063620"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124334"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553527"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.12.028"}],"event":{"name":"WSDM 2013: Sixth ACM International Conference on Web Search and Data Mining","location":"Rome Italy","acronym":"WSDM 2013","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the sixth ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2433396.2433419","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2433396.2433419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:11Z","timestamp":1750277651000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2433396.2433419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,4]]},"references-count":29,"alternative-id":["10.1145\/2433396.2433419","10.1145\/2433396"],"URL":"https:\/\/doi.org\/10.1145\/2433396.2433419","relation":{},"subject":[],"published":{"date-parts":[[2013,2,4]]},"assertion":[{"value":"2013-02-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}