{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:50:05Z","timestamp":1755838205325,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,2,9]],"date-time":"2011-02-09T00:00:00Z","timestamp":1297209600000},"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":[[2011,2,9]]},"DOI":"10.1145\/1935826.1935859","type":"proceedings-article","created":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T15:50:27Z","timestamp":1296575427000},"page":"147-156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Detecting duplicate web documents using clickthrough data"],"prefix":"10.1145","author":[{"given":"Filip","family":"Radlinski","sequence":"first","affiliation":[{"name":"Microsoft, Vancouver, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul N.","family":"Bennett","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emine","family":"Yilmaz","sequence":"additional","affiliation":[{"name":"Microsoft, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,2,9]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498766"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498824"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/LAWEB.2005.23"},{"key":"e_1_3_2_2_4_1","volume-title":"Classification and Regression Trees","author":"Breiman L.","year":"1984","unstructured":"L. Breiman , J. Friedman , R. A. Olshen , and C. J. Stone . Classification and Regression Trees . Chapman and Hall\/CRC , 1984 . L. Breiman, J. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Chapman and Hall\/CRC, 1984."},{"key":"e_1_3_2_2_5_1","first-page":"1","volume-title":"COM `00: Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching","author":"Broder A. Z.","year":"2000","unstructured":"A. Z. Broder . Identifying and filtering near-duplicate documents . In COM `00: Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching , pages 1 -- 10 . Springer-Verlag , 2000 . A. Z. Broder. Identifying and filtering near-duplicate documents. In COM `00: Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, pages 1--10. Springer-Verlag, 2000."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/792550.792552"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(97)00031-7"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291025"},{"key":"e_1_3_2_2_9_1","volume-title":"Proceedings of ECIR `08","author":"Carterette B.","year":"2008","unstructured":"B. Carterette , P. N. Bennett , D. M. Chickering , and S. T. Dumais . Here or there: Preference judgments for relevance . In Proceedings of ECIR `08 , 2008 . B. Carterette, P. N. Bennett, D. M. Chickering, and S. T. Dumais. Here or there: Preference judgments for relevance. In Proceedings of ECIR `08, 2008."},{"key":"e_1_3_2_2_10_1","volume-title":"Proceedings of NIPS `07","author":"Carterette B.","year":"2007","unstructured":"B. Carterette and R. Jones . Evaluating search engines by modeling the relationship between relevance and clicks . In Proceedings of NIPS `07 , 2007 . B. Carterette and R. Jones. Evaluating search engines by modeling the relationship between relevance and clicks. In Proceedings of NIPS `07, 2007."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646033"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148245"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/506309.506311"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04417-5_17"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312220"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835538"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1059981.1059982"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526761"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009079"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835520"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229179.1229181"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1394399"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1670564.1670572"},{"key":"e_1_3_2_2_29_1","volume-title":"Proceedings of AAAI `06","author":"Radlinski F.","year":"2006","unstructured":"F. Radlinski and T. Joachims . Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs . In Proceedings of AAAI `06 , 2006 . F. Radlinski and T. Joachims. Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs. In Proceedings of AAAI `06, 2006."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281254"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390431"},{"key":"e_1_3_2_2_32_1","volume-title":"Information Retrieval. Butterworth","author":"van Rijsbergen C.","year":"1979","unstructured":"C. van Rijsbergen . Information Retrieval. Butterworth , 2 nd edition, 1979 . C. van Rijsbergen. Information Retrieval. Butterworth, 2nd edition, 1979.","edition":"2"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571963"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390310"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860440"},{"key":"e_1_3_2_2_36_1","volume-title":"Proceedings of HLT\/NAACL `07","author":"Zhu X.","year":"2007","unstructured":"X. Zhu , A. B. Goldberg , J. Van Gael , and D. Andrzejewski . Improving Diversity in Ranking using Absorbing Random Walks . In Proceedings of HLT\/NAACL `07 , 2007 . X. Zhu, A. B. Goldberg, J. Van Gael, and D. Andrzejewski. Improving Diversity in Ranking using Absorbing Random Walks. In Proceedings of HLT\/NAACL `07, 2007."}],"event":{"name":"WSDM'11: Fourth ACM International Conference on Web Search and Data Mining","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"],"location":"Hong Kong China","acronym":"WSDM'11"},"container-title":["Proceedings of the fourth ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1935826.1935859","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1935826.1935859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:33Z","timestamp":1750250733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1935826.1935859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,9]]},"references-count":35,"alternative-id":["10.1145\/1935826.1935859","10.1145\/1935826"],"URL":"https:\/\/doi.org\/10.1145\/1935826.1935859","relation":{},"subject":[],"published":{"date-parts":[[2011,2,9]]},"assertion":[{"value":"2011-02-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}