{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:18:18Z","timestamp":1784179098547,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,8,21]],"date-time":"2005-08-21T00:00:00Z","timestamp":1124582400000},"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":[[2005,8,21]]},"DOI":"10.1145\/1081870.1081899","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T17:34:39Z","timestamp":1131384879000},"page":"239-248","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":297,"title":["Query chains"],"prefix":"10.1145","author":[{"given":"Filip","family":"Radlinski","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thorsten","family":"Joachims","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,8,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the Swedish Conference on Connectionism","author":"Bartell B.","year":"1995","unstructured":"B. Bartell and G. W. Cottrell . Learning to retrieve information . In Proceedings of the Swedish Conference on Connectionism , 1995 . B. Bartell and G. W. Cottrell. Learning to retrieve information. In Proceedings of the Swedish Conference on Connectionism, 1995."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/188490.188554"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347176"},{"key":"e_1_3_2_1_4_1","volume-title":"AAAI Workshop on Internet Based Information Systems","author":"Boyan J.","year":"1996","unstructured":"J. Boyan , D. Freitag , and T. Joachims . A machine learning architecture for optimizing web search engines . In AAAI Workshop on Internet Based Information Systems , August 1996 . J. Boyan, D. Freitag, and T. Joachims. A machine learning architecture for optimizing web search engines. In AAAI Workshop on Internet Based Information Systems, August 1996."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/792550.792552"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622859.1622867"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the Conference on Neural Information Processing Systems (NIPS)","author":"Crammer K.","year":"2001","unstructured":"K. Crammer and Y. Singer . Pranking with ranking . In Proceedings of the Conference on Neural Information Processing Systems (NIPS) , 2001 . K. Crammer and Y. Singer. Pranking with ranking. In Proceedings of the Conference on Neural Information Processing Systems (NIPS), 2001."},{"key":"e_1_3_2_1_8_1","first-page":"293","volume-title":"Proceedings of Conference on Empirical Methods in Natural Language Processing (EMNLP)","author":"Cucerzan S.","year":"2004","unstructured":"S. Cucerzan and E. Brill . Spelling correction as an iterative process that exploits the collective knowledge of web users . In Proceedings of Conference on Empirical Methods in Natural Language Processing (EMNLP) , pages 293 -- 300 , 2004 . S. Cucerzan and E. Brill. Spelling correction as an iterative process that exploits the collective knowledge of web users. In Proceedings of Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 293--300, 2004."},{"key":"e_1_3_2_1_9_1","volume-title":"International Conference on Machine Learning (ICML)","author":"Freund Y.","year":"1998","unstructured":"Y. Freund , R. Iyer , R. E. Schapire , and Y. Singer . An efficient boosting algorithm for combining preferences . In International Conference on Machine Learning (ICML) , 1998 . Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. In International Conference on Machine Learning (ICML), 1998."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/317456.317480"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009079"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009079"},{"key":"e_1_3_2_1_13_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_14_1","volume-title":"Advances in Kernel Methods -- Support Vector Machines","author":"Joachims T.","year":"1999","unstructured":"T. Joachims . Making large-scale SVM learning practical . In B. Sch\u00bflkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods -- Support Vector Machines . MIT Press , 1999 . T. Joachims. Making large-scale SVM learning practical. In B. Sch\u00bflkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods -- Support Vector Machines. MIT Press, 1999."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_16_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 . Physica\/Springer Verlag , 2003 . T. Joachims. Evaluating retrieval performance using clickthrough data. In J. Franke, G. Nakhaeizadeh, and I. Renz, editors, Text Mining, pages 79--96. Physica\/Springer Verlag, 2003."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076063"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860538"},{"key":"e_1_3_2_1_19_1","first-page":"263","volume-title":"T. E. et al.","author":"Kemp C.","year":"2003","unstructured":"C. Kemp and K. Ramamohanarao . Long-term learning for web search engines . In T. E. et al. , editor, PKDD , pages 263 -- 274 , 2003 . C. Kemp and K. Ramamohanarao. Long-term learning for web search engines. In T. E. et al., editor, PKDD, pages 263--274, 2003."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/317328.317340"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511490"},{"key":"e_1_3_2_1_22_1","series-title":"Lecture Notes in Artificial Intelligence","first-page":"301","volume-title":"Classification approach towards ranking and sorting problems","author":"Rajaram S.","year":"2003","unstructured":"S. Rajaram , A. Garg , Z. S. Zhou , and T. S. Huang . Classification approach towards ranking and sorting problems . In Lecture Notes in Artificial Intelligence , volume 2837 , pages 301 -- 312 , September 2003 . S. Rajaram, A. Garg, Z. S. Zhou, and T. S. Huang. Classification approach towards ranking and sorting problems. In Lecture Notes in Artificial Intelligence, volume 2837, pages 301--312, September 2003."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584846"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24571-1_48"}],"event":{"name":"KDD05: The Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Chicago Illinois USA","acronym":"KDD05","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 eleventh ACM SIGKDD international conference on Knowledge discovery in data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1081870.1081899","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1081870.1081899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:37Z","timestamp":1750263517000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1081870.1081899"}},"subtitle":["learning to rank from implicit feedback"],"short-title":[],"issued":{"date-parts":[[2005,8,21]]},"references-count":24,"alternative-id":["10.1145\/1081870.1081899","10.1145\/1081870"],"URL":"https:\/\/doi.org\/10.1145\/1081870.1081899","relation":{},"subject":[],"published":{"date-parts":[[2005,8,21]]},"assertion":[{"value":"2005-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}