{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T20:25:09Z","timestamp":1730319909776,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T00:00:00Z","timestamp":1531785600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,19]]},"DOI":"10.1145\/3219819.3220028","type":"proceedings-article","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T13:05:12Z","timestamp":1532005512000},"page":"1685-1694","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Offline Evaluation of Ranking Policies with Click Models"],"prefix":"10.1145","author":[{"given":"Shuai","family":"Li","sequence":"first","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Yasin","family":"Abbasi-Yadkori","sequence":"additional","affiliation":[{"name":"Adobe Research, San Jose, CA, USA"}]},{"given":"Branislav","family":"Kveton","sequence":"additional","affiliation":[{"name":"Adobe Research, San Jose, CA, USA"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[{"name":"Rutgers University, New Brunswick, NJ, USA"}]},{"given":"Vishwa","family":"Vinay","sequence":"additional","affiliation":[{"name":"Adobe Research, Bangalore, India"}]},{"given":"Zheng","family":"Wen","sequence":"additional","affiliation":[{"name":"Adobe Research, San Jose, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,7,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020281327116"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2567766"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010037"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646033"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526711"},{"volume-title":"Proceedings of the 30th International Conference on Machine Learning. 151--159","year":"2013","author":"Chen Wei","key":"e_1_3_2_2_6_1","unstructured":"Wei Chen , Yajun Wang , and Yang Yuan . 2013 . Combinatorial Multi-Armed Bandit: General Framework, Results and Applications . In Proceedings of the 30th International Conference on Machine Learning. 151--159 . Wei Chen, Yajun Wang, and Yang Yuan . 2013. Combinatorial Multi-Armed Bandit: General Framework, Results and Applications. In Proceedings of the 30th International Conference on Machine Learning. 151--159."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Aleksandr Chuklin Ilya Markov and Maarten de Rijke . 2015. Click Models for Web Search. Morgan & Claypool. Aleksandr Chuklin Ilya Markov and Maarten de Rijke . 2015. Click Models for Web Search. Morgan & Claypool.","DOI":"10.1007\/978-3-031-02294-4"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484071"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"volume-title":"Proceedings of the 28th International Conference on Machine Learning (ICML-11)","year":"2011","author":"Dud'\u0131k Miroslav","key":"e_1_3_2_2_10_1","unstructured":"Miroslav Dud'\u0131k , John Langford , and Lihong Li . 2011 . Doubly Robust Policy Evaluation and Learning . In Proceedings of the 28th International Conference on Machine Learning (ICML-11) . 1097--1104. Miroslav Dud'\u0131k, John Langford, and Lihong Li . 2011. Doubly Robust Policy Evaluation and Learning. In Proceedings of the 28th International Conference on Machine Learning (ICML-11). 1097--1104."},{"key":"e_1_3_2_2_11_1","unstructured":"Georges Dupret Vanessa Murdock and Benjamin Piwowarski . 2007. Web search engine evaluation using clickthrough data and a user model WWW2007 workshop Query Log Analysis: Social and Technological Challenges. Georges Dupret Vanessa Murdock and Benjamin Piwowarski . 2007. Web search engine evaluation using clickthrough data and a user model WWW2007 workshop Query Log Analysis: Social and Technological Challenges."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390392"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2181864"},{"volume-title":"arXiv preprint arXiv:1801.07030","year":"2018","author":"Gilotte Alexandre","key":"e_1_3_2_2_14_1","unstructured":"Alexandre Gilotte , Cl\u00e9ment Calauz\u00e8nes , Thomas Nedelec , Alexandre Abraham , and Simon Doll\u00e9 . 2018. Offline A\/B testing for Recommender Systems . arXiv preprint arXiv:1801.07030 ( 2018 ). Alexandre Gilotte, Cl\u00e9ment Calauz\u00e8nes, Thomas Nedelec, Alexandre Abraham, and Simon Doll\u00e9 . 2018. Offline A\/B testing for Recommender Systems. arXiv preprint arXiv:1801.07030 (2018)."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498818"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000051"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398516"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076063"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018699"},{"volume-title":"Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits Proceedings of the 18th International Conference on Artificial Intelligence and Statistics.","year":"2015","author":"Kveton Branislav","key":"e_1_3_2_2_20_1","unstructured":"Branislav Kveton , Zheng Wen , Azin Ashkan , and Csaba Szepesvari . 2015 . Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits Proceedings of the 18th International Conference on Artificial Intelligence and Statistics. Branislav Kveton, Zheng Wen, Azin Ashkan, and Csaba Szepesvari . 2015. Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits Proceedings of the 18th International Conference on Artificial Intelligence and Statistics."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390223"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935878"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1416950.1416952"},{"key":"e_1_3_2_2_24_1","volume-title":"Proceedings of the 31th International Conference on Machine Learning (ICML-2014)","volume":"32","author":"Nicol Olivier","year":"2014","unstructured":"Olivier Nicol , J\u00e9r\u00e9mie Mary , and Philippe Preux . 2014 . Improving offline evaluation of contextual bandit algorithms via bootstrapping techniques . In Proceedings of the 31th International Conference on Machine Learning (ICML-2014) , Beijing, China , Vol. Vol. 32 . 172--180. Olivier Nicol, J\u00e9r\u00e9mie Mary, and Philippe Preux . 2014. Improving offline evaluation of contextual bandit algorithms via bootstrapping techniques. In Proceedings of the 31th International Conference on Machine Learning (ICML-2014), Beijing, China, Vol. Vol. 32. 172--180."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458092"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"volume-title":"The most powerful way to turn clicks into customers","author":"Siroker Dan","key":"e_1_3_2_2_27_1","unstructured":"Dan Siroker and Pete Koomen . 2013. A\/B testing : The most powerful way to turn clicks into customers . John Wiley & Sons . Dan Siroker and Pete Koomen . 2013. A\/B testing: The most powerful way to turn clicks into customers. John Wiley & Sons."},{"key":"e_1_3_2_2_28_1","unstructured":"Alex Strehl John Langford Lihong Li and Sham M Kakade . 2010. Learning from logged implicit exploration data. In Advances in Neural Information Processing Systems. 2217--2225. Alex Strehl John Langford Lihong Li and Sham M Kakade . 2010. Learning from logged implicit exploration data. In Advances in Neural Information Processing Systems. 2217--2225."},{"volume-title":"Off-policy evaluation for slate recommendation. arXiv preprint arXiv:1605.04812","year":"2016","author":"Swaminathan Adith","key":"e_1_3_2_2_29_1","unstructured":"Adith Swaminathan , Akshay Krishnamurthy , Alekh Agarwal , Miroslav Dud'\u0131k , John Langford , Damien Jose , and Imed Zitouni . 2016. Off-policy evaluation for slate recommendation. arXiv preprint arXiv:1605.04812 ( 2016 ). Adith Swaminathan, Akshay Krishnamurthy, Alekh Agarwal, Miroslav Dud'\u0131k, John Langford, Damien Jose, and Imed Zitouni . 2016. Off-policy evaluation for slate recommendation. arXiv preprint arXiv:1605.04812 (2016)."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557164"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Xuanhui Wang Nadav Golbandi Michael Bendersky Donald Metzler and Marc Najork . 2018. Position Bias Estimation for Unbiased Learning to Rank in Personal Search. (2018). Xuanhui Wang Nadav Golbandi Michael Bendersky Donald Metzler and Marc Najork . 2018. Position Bias Estimation for Unbiased Learning to Rank in Personal Search. (2018).","DOI":"10.1145\/3159652.3159732"},{"volume-title":"Efficient Learning in Large-Scale Combinatorial Semi-Bandits Proceedings of the 32nd International Conference on Machine Learning.","year":"2015","author":"Wen Zheng","key":"e_1_3_2_2_32_1","unstructured":"Zheng Wen , Branislav Kveton , and Azin Ashkan . 2015 . Efficient Learning in Large-Scale Combinatorial Semi-Bandits Proceedings of the 32nd International Conference on Machine Learning. Zheng Wen, Branislav Kveton, and Azin Ashkan . 2015. Efficient Learning in Large-Scale Combinatorial Semi-Bandits Proceedings of the 32nd International Conference on Machine Learning."},{"key":"e_1_3_2_2_33_1","unstructured":"Yandex 2013. Yandex Personalized Web Search Challenge. https:\/\/www.kaggle.com\/c\/yandex-personalized-web-search-challenge. Yandex 2013. Yandex Personalized Web Search Challenge. https:\/\/www.kaggle.com\/c\/yandex-personalized-web-search-challenge."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871672"}],"event":{"name":"KDD '18: The 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"London United Kingdom","acronym":"KDD '18"},"container-title":["Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219819.3220028","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T12:28:10Z","timestamp":1673699290000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219819.3220028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,19]]},"references-count":34,"alternative-id":["10.1145\/3219819.3220028","10.1145\/3219819"],"URL":"https:\/\/doi.org\/10.1145\/3219819.3220028","relation":{},"subject":[],"published":{"date-parts":[[2018,7,19]]},"assertion":[{"value":"2018-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}