The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Optimizing search engines using clickthrough data
Abstract
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous approaches to learning retrieval functions from examples exist, they typically require training data generated from relevance judgments by experts. This makes them difficult and expensive to apply. The goal of this paper is to develop a method that utilizes clickthrough data for training, namely the query-log of the search engine in connection with the log of links the users clicked on in the presented ranking. Such clickthrough data is available in abundance and can be recorded at very low cost. Taking a Support Vector Machine (SVM) approach, this paper presents a method for learning retrieval functions. From a theoretical perspective, this method is shown to be well-founded in a risk minimization framework. Furthermore, it is shown to be feasible even for large sets of queries and features. The theoretical results are verified in a controlled experiment. It shows that the method can effectively adapt the retrieval function of a meta-search engine to a particular group of users, outperforming Google in terms of retrieval quality after only a couple of hundred training examples.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Baeza-Yates, R. A., & Ribeiro-Neto, B. A. (1999) · Cited by 11,505
Term-weighting approaches in automatic text retrieval
Salton, G., & Buckley, C. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90021-0 · Cited by 9,740
Kendall, M. G. (1957) · Biometrika · doi:10.2307/2333282 · Cited by 6,383
Advances in kernel methods: support vector learning
Schölkopf, B., Burges, C. J. C., & Smola, A. J. (1999) · doi:10.5555/299094 · Cited by 5,789
Making Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411
Self-citationAn Introduction to the Theory of Statistics
(1911) · Nature · doi:10.1038/087345a0 · Cited by 4,394
Cited by
Items 101–126 of 126
Accurately Interpreting Clickthrough Data as Implicit Feedback
Joachims, T., Granka, L., Pan, B., Hembrooke, H., & Gay, G. (2017) · ACM SIGIR Forum · doi:10.1145/3130332.3130334 · Cited by 212
Self-citationMining query logs: turning search usage data into knowledge
Silvestri, F. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000013 · Cited by 194
“This problem can be solved using a SVM, and Joachims [114] shows how it can be extended to include also non-linear ranking functions.”
BackgroundMethodInfluentialBest Match: New relevance search for PubMed
Fiorini, N., Canese, K., Starchenko, G., Kireev, E., Kim, W., Miller, V., Osipov, M., Kholodov, M., Ismagilov, R., Mohan, S., et al. (2018) · PLOS Biology · doi:10.1371/journal.pbio.2005343 · Cited by 175
Modeling dwell time to predict click-level satisfaction
Kim, Y., Hassan, A., White, R. W., & Zitouni, I. (2014) · Proceedings of the 7th ACM international conference on Web search and data mining · doi:10.1145/2556195.2556220 · Cited by 164
Understanding User Satisfaction with Intelligent Assistants
Kiseleva, J., Williams, K., Jiang, J., Hassan Awadallah, A., Crook, A. C., Zitouni, I., & Anastasakos, T. (2016) · Proceedings of the 2016 ACM on Conference on Human Information Interaction and Retrieval · doi:10.1145/2854946.2854961 · Cited by 150
The LambdaLoss Framework for Ranking Metric Optimization
Wang, X., Li, C., Golbandi, N., Bendersky, M., & Najork, M. (2018) · Proceedings of the 27th ACM International Conference on Information and Knowledge Management · doi:10.1145/3269206.3271784 · Cited by 136
“For example, RankingSVM [17] uses a linear model; LambdaMART [4] uses a treebased model; RankNet [3] uses a neural network model.”
BackgroundMethodA General Framework for Counterfactual Learning-to-Rank
Agarwal, A., Takatsu, K., Zaitsev, I., & Joachims, T. (2019) · Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3331184.3331202 · Cited by 115
Self-citationPredicting User Satisfaction with Intelligent Assistants
Kiseleva, J., Williams, K., Hassan Awadallah, A., Crook, A. C., Zitouni, I., & Anastasakos, T. (2016) · Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval · doi:10.1145/2911451.2911521 · Cited by 108
Analyzing and mining a code search engine usage log
Bajracharya, S. K., & Lopes, C. V. (2012) · Empirical Software Engineering · doi:10.1007/s10664-010-9144-6 · Cited by 90
Advancing the search frontier with AI agents
White, R. W. (2024) · Communications of the ACM · doi:10.1145/3655615 · Cited by 55
Automatic Chinese Factual Question Generation
Liu, M., Rus, V., & Liu, L. (2017) · IEEE Transactions on Learning Technologies · doi:10.1109/tlt.2016.2565477 · Cited by 52
Combating Product Review Spam Campaigns via Multiple Heterogeneous Pairwise Features
Xu, C., & Zhang, J. (2015) · Proceedings of the 2015 SIAM International Conference on Data Mining · doi:10.1137/1.9781611974010.20 · Cited by 51
Your Hometown Matters: Popularity-Difference Bias in Online Reputation Platforms
Kokkodis, M., & Lappas, T. (2020) · Information Systems Research · doi:10.1287/isre.2019.0895 · Cited by 48
RefSum: Refactoring Neural Summarization
Liu, Y., Dou, Z.-Y., & Liu, P. (2021) · Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/2021.naacl-main.113 · Cited by 36
A reinforcement learning framework for relevance feedback
Montazeralghaem, A., Zamani, H., & Allan, J. (2020) · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3397271.3401099 · Cited by 36
Probabilistic Graphical Models for Boosting Cardinal and Ordinal Peer Grading in MOOCs
Mi, F., & Yeung, D.-Y. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9210 · Cited by 34
Multiplicity and word sense: evaluating and learning from multiply labeled word sense annotations
Passonneau, R. J., Bhardwaj, V., Salleb-Aouissi, A., & Ide, N. (2012) · Language Resources and Evaluation · doi:10.1007/s10579-012-9188-x · Cited by 34
Captions and biases in diagnostic search
White, R. W., & Horvitz, E. (2013) · ACM Transactions on the Web · doi:10.1145/2486040 · Cited by 29
Learning to rank search results for time-sensitive queries
Kanhabua, N., & Nørvåg, K. (2012) · Proceedings of the 21st ACM international conference on Information and knowledge management · doi:10.1145/2396761.2398667 · Cited by 26
Ranking related news predictions
Kanhabua, N., Blanco, R., & Matthews, M. (2011) · Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval · doi:10.1145/2009916.2010018 · Cited by 24
Learning landmark salience models from users’ route instructions
Götze, J., & Boye, J. (2016) · Journal of Location Based Services · doi:10.1080/17489725.2016.1172739 · Cited by 24
Detecting duplicate web documents using clickthrough data
Radlinski, F., Bennett, P. N., & Yilmaz, E. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935859 · Cited by 19
“Consequently, models of user click behavior [3, 16, 11, 18] have been mainly used to infer relevance of documents [24, 30, 2, 10].”
MethodSearch result re-ranking by feedback control adjustment for time-sensitive query
Zhang, R., Chang, Y., Zheng, Z., Metzler, D., & Nie, J.-Y. (2009) · Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers on - NAACL '09 · doi:10.3115/1620853.1620899 · Cited by 11
Session Based Click Features for Recency Ranking
Inagaki, Y., Sadagopan, N., Dupret, G., Dong, A., Liao, C., Chang, Y., & Zheng, Z. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7517 · Cited by 7
Not All Samples are Trustworthy: Towards Deep Robust SVP Prediction
Xu, Q., Yang, Z., Jiang, Y., Cao, X., Yao, Y., & Huang, Q. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.3047817 · Cited by 6
Claw-SWE-Bench: A Benchmark for Evaluating OpenClaw-style Agent Harnesses on Coding Tasks
Zheng, M., Han, K., Li, B., Xu, H., Tian, Y., He, W., Zhou, H., Guo, J., Hu, H., Ma, L., et al. (2026) · arXiv · doi:10.48550/arxiv.2606.12344
“We therefore include a pairwise ranking hinge term [13].”
Metadata
- Authors
- Joachims, T.
- Venue
- Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2002-07-23
- Pages
- 133-142
- OpenAlex
- W2047221353
- Cited by
- 3,873
- References
- 34
- FWCI
- 27.56
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.