{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:15:48Z","timestamp":1775283348975,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,2,24]],"date-time":"2014-02-24T00:00:00Z","timestamp":1393200000000},"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":[[2014,2,24]]},"DOI":"10.1145\/2556195.2556256","type":"proceedings-article","created":{"date-parts":[[2014,2,18]],"date-time":"2014-02-18T14:10:41Z","timestamp":1392732641000},"page":"73-82","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Relative confidence sampling for efficient on-line ranker evaluation"],"prefix":"10.1145","author":[{"given":"Masrour","family":"Zoghi","sequence":"first","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shimon A.","family":"Whiteson","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten","family":"de Rijke","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Remi","family":"Munos","sequence":"additional","affiliation":[{"name":"INRIA Lille - Nord Europe, Villeneuve d'Ascq, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,2,24]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"Conference on Learning Theory","author":"Agrawal S.","year":"2012","unstructured":"S. Agrawal and N. Goyal . Analysis of Thompson sampling for the multi-armed bandit problem . In Conference on Learning Theory , pages 1 -- 26 , 2012 . S. Agrawal and N. Goyal. Analysis of Thompson sampling for the multi-armed bandit problem. In Conference on Learning Theory, pages 1--26, 2012."},{"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","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021053"},{"key":"e_1_3_2_1_4_1","first-page":"1","article-title":"Yahoo! learning to rank challenge overview","volume":"14","author":"Chapelle O.","year":"2011","unstructured":"O. Chapelle and Y. Chang . Yahoo! learning to rank challenge overview . Journal of Machine Learning Research-Proceedings Track , 14 : 1 -- 24 , 2011 . O. Chapelle and Y. Chang. Yahoo! learning to rank challenge overview. Journal of Machine Learning Research-Proceedings Track, 14:1--24, 2011.","journal-title":"Journal of Machine Learning Research-Proceedings Track"},{"key":"e_1_3_2_1_5_1","volume-title":"NIPS","author":"Chapelle O.","year":"2011","unstructured":"O. Chapelle and L. Li . An empirical evaluation of Thompson sampling . In NIPS , 2011 . O. Chapelle and L. Li. An empirical evaluation of Thompson sampling. In NIPS, 2011."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2094072.2094078"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505698"},{"key":"e_1_3_2_1_8_1","volume-title":"ASLIB Cranfield project.","author":"Cleverdon C. W.","year":"1966","unstructured":"C. W. Cleverdon , J. Mills , and M. Keen . Factors determining the performance of indexing systems . In ASLIB Cranfield project. 1966 . C. W. Cleverdon, J. Mills, and M. Keen. Factors determining the performance of indexing systems. In ASLIB Cranfield project. 1966."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_1_10_1","volume-title":"ICML","author":"de Freitas N.","year":"2012","unstructured":"N. de Freitas , A. Smola , and M. Zoghi . Exponential regret bounds for Gaussian process bandits with deterministic observations . In ICML , 2012 . N. de Freitas, A. Smola, and M. Zoghi. Exponential regret bounds for Gaussian process bandits with deterministic observations. In ICML, 2012."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1507509.1507523"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498818"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646293"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063618"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2536736.2536737"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9197-9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571950"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_19_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 . 2003 . T. Joachims. Evaluating retrieval performance using clickthrough data. In J. Franke, G. Nakhaeizadeh, and I. Renz, editors, Text Mining, pages 79--96. 2003."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2006.07.021"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1507509.1507522"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34106-9_18"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"e_1_3_2_1_24_1","unstructured":"Microsoft Learning to Rank Datasets 2012. http:\/\/research.microsoft.com\/en-us\/projects\/mslr\/default.aspx.  Microsoft Learning to Rank Datasets 2012. http:\/\/research.microsoft.com\/en-us\/projects\/mslr\/default.aspx."},{"key":"e_1_3_2_1_25_1","volume-title":"NIPS","author":"Munos R.","year":"2011","unstructured":"R. Munos . Optimistic optimization of a deterministic function without the knowledge of its smoothness . In NIPS , 2011 . R. Munos. Optimistic optimization of a deterministic function without the knowledge of its smoothness. In NIPS, 2011."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835560"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433429"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458092"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1793274.1793282"},{"key":"e_1_3_2_1_30_1","volume-title":"ICML","author":"Srinivas N.","year":"2010","unstructured":"N. Srinivas , A. Krause , S. M. Kakade , and M. Seeger . Gaussian process optimization in the bandit setting: No regret and experimental design . In ICML , 2010 . N. Srinivas, A. Krause, S. M. Kakade, and M. Seeger. Gaussian process optimization in the bandit setting: No regret and experimental design. In ICML, 2010."},{"key":"e_1_3_2_1_31_1","first-page":"285","volume-title":"Biometrika","author":"Thompson W.","year":"1933","unstructured":"W. Thompson . On the likelihood that one unknown probability exceeds another in view of the evidence of two samples . Biometrika , pages 285 -- 294 , 1933 . W. Thompson. On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika, pages 285--294, 1933."},{"key":"e_1_3_2_1_32_1","volume-title":"ICML","author":"Urvoy T.","year":"2013","unstructured":"T. Urvoy , F. Clerot , R. F\u00e9raud , and S. Naamane . Generic exploration and k-armed voting bandits . In ICML , 2013 . T. Urvoy, F. Clerot, R. F\u00e9raud, and S. Naamane. Generic exploration and k-armed voting bandits. In ICML, 2013."},{"key":"e_1_3_2_1_33_1","volume-title":"ICML","author":"Valko M.","year":"2013","unstructured":"M. Valko , A. Carpentier , and R. Munos . Stochastic simultaneous optimistic optimization . In ICML , 2013 . M. Valko, A. Carpentier, and R. Munos. Stochastic simultaneous optimistic optimization. In ICML, 2013."},{"key":"e_1_3_2_1_34_1","volume-title":"TREC: Experiment and Evaluation in Information Retrieval","author":"Voorhees E. M.","year":"2005","unstructured":"E. M. Voorhees and D. K. Harman . TREC: Experiment and Evaluation in Information Retrieval . MIT Press , 2005 . E. M. Voorhees and D. K. Harman. TREC: Experiment and Evaluation in Information Retrieval. MIT Press, 2005."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553527"},{"key":"e_1_3_2_1_36_1","volume-title":"ICML","author":"Yue Y.","year":"2011","unstructured":"Y. Yue and T. Joachims . Beat the mean bandit . In ICML , 2011 . Y. Yue and T. Joachims. Beat the mean bandit. In ICML, 2011."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.12.028"},{"key":"e_1_3_2_1_38_1","volume-title":"Relative upper confidence bound for the k-armed dueling bandits problem. Techn. Report arXiv:1312.3393","author":"Zoghi M.","year":"2013","unstructured":"M. Zoghi , S. Whiteson , R. Munos , and M. de Rijke . Relative upper confidence bound for the k-armed dueling bandits problem. Techn. Report arXiv:1312.3393 , 2013 . M. Zoghi, S. Whiteson, R. Munos, and M. de Rijke. Relative upper confidence bound for the k-armed dueling bandits problem. Techn. Report arXiv:1312.3393, 2013."}],"event":{"name":"WSDM 2014: Seventh ACM International Conference on Web Search and Data Mining","location":"New York New York USA","acronym":"WSDM 2014","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 7th ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2556195.2556256","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2556195.2556256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:51Z","timestamp":1750232091000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2556195.2556256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,24]]},"references-count":38,"alternative-id":["10.1145\/2556195.2556256","10.1145\/2556195"],"URL":"https:\/\/doi.org\/10.1145\/2556195.2556256","relation":{},"subject":[],"published":{"date-parts":[[2014,2,24]]},"assertion":[{"value":"2014-02-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}