{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:10Z","timestamp":1750308550972,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,9,27]],"date-time":"2015-09-27T00:00:00Z","timestamp":1443312000000},"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":[[2015,9,27]]},"DOI":"10.1145\/2808194.2809464","type":"proceedings-article","created":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T19:31:27Z","timestamp":1442950287000},"page":"291-300","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Implicit Preference Labels for Learning Highly Selective Personalized Rankers"],"prefix":"10.1145","author":[{"given":"Paul N.","family":"Bennett","sequence":"first","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]},{"given":"Milad","family":"Shokouhi","sequence":"additional","affiliation":[{"name":"Microsoft, Cambridge, United Kingdom"}]},{"given":"Rich","family":"Caruana","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, Uae"}]}],"member":"320","published-online":{"date-parts":[[2015,9,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148177"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148175"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348312"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009938"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. NIPS","author":"Burges C.","year":"2006","unstructured":"C. Burges , R. Ragno , and Q. Le . Learning to rank with non-smooth cost functions . In Proc. NIPS , 2006 . C. Burges, R. Ragno, and Q. Le. Learning to rank with non-smooth cost functions. In Proc. NIPS, 2006."},{"key":"e_1_3_2_1_6_1","first-page":"14","article-title":"Learning to rank using an ensemble of lambda-gradient models","author":"Burges C. J. C.","year":"2011","unstructured":"C. J. C. Burges , K. M. Svore , P. N. Bennett , A. Pastusiak , and Q. Wu . Learning to rank using an ensemble of lambda-gradient models . JMLR , 14 , 2011 . C. J. C. Burges, K. M. Svore, P. N. Bennett, A. Pastusiak, and Q. Wu. Learning to rank using an ensemble of lambda-gradient models. JMLR, 14, 2011.","journal-title":"JMLR"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526711"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484071"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646059"},{"key":"e_1_3_2_1_10_1","volume-title":"TREC '13","author":"Collins-Thompson K.","year":"2013","unstructured":"K. Collins-Thompson , P. N. Bennett , F. Diaz , C. Clarke , and E. M. Voorhees . Trec 2013 web track overview . In TREC '13 , 2013 . K. Collins-Thompson, P. N. Bennett, F. Diaz, C. Clarke, and E. M. Voorhees. Trec 2013 web track overview. In TREC '13, 2013."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609625"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772725"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390392"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076116"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148193"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1059981.1059982"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526761"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526712"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229179.1229181"},{"key":"e_1_3_2_1_23_1","volume-title":"Learning to rank for information retrieval. Foundations and Trends in Information Retrieval, 3 (3)","author":"Liu T.-Y.","year":"2009","unstructured":"T.-Y. Liu . Learning to rank for information retrieval. Foundations and Trends in Information Retrieval, 3 (3) , 2009 . T.-Y. Liu. Learning to rank for information retrieval. Foundations and Trends in Information Retrieval, 3 (3), 2009."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081899"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458092"},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. ICML","author":"Raman K.","year":"2013","unstructured":"K. Raman , T. Joachims , P. Shivaswamy , and T. Shnabel . Stable coactive learning via perturbation . In Proc. ICML , 2013 . K. Raman, T. Joachims, P. Shivaswamy, and T. Shnabel. Stable coactive learning via perturbation. In Proc. ICML, 2013."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076045"},{"key":"e_1_3_2_1_28_1","volume-title":"Proc. ICML","author":"Shivaswamy P.","year":"2012","unstructured":"P. Shivaswamy and T. Joachims . Online structured prediction via coactive learning . In Proc. ICML , 2012 . P. Shivaswamy and T. Joachims. Online structured prediction via coactive learning. In Proc. ICML, 2012."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484076"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484075"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321515"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963459"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390364"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935848"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505679"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741105"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348385"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9112-1"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835525"}],"event":{"name":"ICTIR '15: ACM SIGIR International Conference on the Theory of Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Northampton Massachusetts USA","acronym":"ICTIR '15"},"container-title":["Proceedings of the 2015 International Conference on The Theory of Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2808194.2809464","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2808194.2809464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:46Z","timestamp":1750273426000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2808194.2809464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,27]]},"references-count":39,"alternative-id":["10.1145\/2808194.2809464","10.1145\/2808194"],"URL":"https:\/\/doi.org\/10.1145\/2808194.2809464","relation":{},"subject":[],"published":{"date-parts":[[2015,9,27]]},"assertion":[{"value":"2015-09-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}