{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T02:29:08Z","timestamp":1783736948673,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:00:00Z","timestamp":1186876800000},"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":[[2007,8,12]]},"DOI":"10.1145\/1281192.1281254","type":"proceedings-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:41Z","timestamp":1197055181000},"page":"570-579","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":90,"title":["Active exploration for learning rankings from clickthrough data"],"prefix":"10.1145","author":[{"given":"Filip","family":"Radlinski","sequence":"first","affiliation":[{"name":"Cornell University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thorsten","family":"Joachims","sequence":"additional","affiliation":[{"name":"Cornell University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148175"},{"key":"e_1_3_2_1_2_1","first-page":"324","article-title":"The rank analysis of incomplete block designs. 1. the method of paired comparisons","volume":"39","author":"Bradley R. A.","year":"1952","unstructured":"R. A. Bradley and M. E. Terry . The rank analysis of incomplete block designs. 1. the method of paired comparisons . Biometrika , 39 : 324 -- 345 , 1952 . R. A. Bradley and M. E. Terry. The rank analysis of incomplete block designs. 1. the method of paired comparisons. Biometrika, 39:324--345, 1952.","journal-title":"Biometrika"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015331"},{"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\/1148170.1148219"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the National Conference on Artificial Intel ligence (AAAI)","author":"U.","year":"2000","unstructured":"U. Cha jewska, D. Koller , and R. Parr . Making rational decisions using adaptive utility elicitation . In Proceedings of the National Conference on Artificial Intel ligence (AAAI) , 2000 . U. Cha jewska, D. Koller, and R. Parr. Making rational decisions using adaptive utility elicitation. In Proceedings of the National Conference on Artificial Intel ligence (AAAI), 2000."},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the NIPS 2005 Workshop on Learning to Rank","author":"Chu W.","year":"2005","unstructured":"W. Chu and Z. Ghahramani . Extensions of gaussian processes for ranking: Semi--supervised and active learning . In Proceedings of the NIPS 2005 Workshop on Learning to Rank , 2005 . W. Chu and Z. Ghahramani. Extensions of gaussian processes for ranking: Semi--supervised and active learning. In Proceedings of the NIPS 2005 Workshop on Learning to Rank, 2005."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102369"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the International Conference on Advances in Neural Information Processing Systems (NIPS)","author":"Dekel O.","year":"2003","unstructured":"O. Dekel , C. D. Manning , and Y. Singer . Log-linear models for label ranking . In Proceedings of the International Conference on Advances in Neural Information Processing Systems (NIPS) , 2003 . O. Dekel, C. D. Manning, and Y. Singer. Log-linear models for label ranking. In Proceedings of the International Conference on Advances in Neural Information Processing Systems (NIPS), 2003."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/65943.65944"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9876.00159"},{"key":"e_1_3_2_1_12_1","volume-title":"Bayesian optimal design of knockout tournaments","author":"Glickman M. E.","year":"2006","unstructured":"M. E. Glickman . Bayesian optimal design of knockout tournaments , 2006 . Under Review . M. E. Glickman. Bayesian optimal design of knockout tournaments, 2006. Under Review."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2003.09.022"},{"key":"e_1_3_2_1_14_1","volume-title":"Eye tracking analysis of user behaviors in online search. Master's thesis","author":"Granka L.","year":"2004","unstructured":"L. Granka . Eye tracking analysis of user behaviors in online search. Master's thesis , Cornell University , 2004 . L. Granka. Eye tracking analysis of user behaviors in online search. Master's thesis, Cornell University, 2004."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009079"},{"key":"e_1_3_2_1_16_1","volume-title":"Overview of the TREC-2001 web track","author":"Hawking D.","year":"2001","unstructured":"D. Hawking and N. Craswell . Overview of the TREC-2001 web track . Nov 2001 . D. Hawking and N. Craswell. Overview of the TREC-2001 web track. Nov 2001."},{"key":"e_1_3_2_1_18_1","first-page":"115","volume-title":"A. S. et al.","author":"Herbrich R.","year":"2000","unstructured":"R. Herbrich , T. Graepel , and K. Obermayer . Large margin rank boundaries for ordinal regression . In A. S. et al. , editor, Advances in Large Margin Classifiers , pages 115 -- 132 , 2000 . R. Herbrich, T. Graepel, and K. Obermayer. Large margin rank boundaries for ordinal regression. In A. S. et al., editor, Advances in Large Margin Classifiers, pages 115--132, 2000."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1079120141"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229179.1229181"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/06-BA130"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the International Conference on Very Large Data Bases (VLDB)","author":"Pandey S.","year":"2005","unstructured":"S. Pandey , S. Roy , C. Olston , J. Cho , and S. Chakrabarti . Shuffling a stacked deck: The case for partially randomized ranking of search engine results . In Proceedings of the International Conference on Very Large Data Bases (VLDB) , 2005 . S. Pandey, S. Roy, C. Olston, J. Cho, and S. Chakrabarti. Shuffling a stacked deck: The case for partially randomized ranking of search engine results. In Proceedings of the International Conference on Very Large Data Bases (VLDB), 2005."},{"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","volume-title":"Proceedings of the National Conference on Artificial Intel ligence (AAAI)","author":"Radlinski F.","year":"2006","unstructured":"F. Radlinski and T. Joachims . Minimally invasive randomization for collecting unbiased preferences from clickthrough logs . In Proceedings of the National Conference on Artificial Intel ligence (AAAI) , 2006 . F. Radlinski and T. Joachims. Minimally invasive randomization for collecting unbiased preferences from clickthrough logs. In Proceedings of the National Conference on Artificial Intel ligence (AAAI), 2006."},{"key":"e_1_3_2_1_26_1","unstructured":"D. Ryvkin. The predictive power of noisy elimination tournaments. Under review.  D. Ryvkin. The predictive power of noisy elimination tournaments. Under review."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000011806.12374.c3"}],"event":{"name":"KDD07: The 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"San Jose California USA","acronym":"KDD07","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1281192.1281254","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1281192.1281254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:57:54Z","timestamp":1750258674000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1281192.1281254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,12]]},"references-count":26,"alternative-id":["10.1145\/1281192.1281254","10.1145\/1281192"],"URL":"https:\/\/doi.org\/10.1145\/1281192.1281254","relation":{},"subject":[],"published":{"date-parts":[[2007,8,12]]},"assertion":[{"value":"2007-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}