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
Learning to Classify Text Using Support Vector Machines
Joachims, T. (2002) · Springer eBooks · doi:10.1007/978-1-4615-0907-3 · Cited by 1,366
Self-citationProceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2017)
Amendola, G., Ricca, F., & Truszczyński, M. (2017) · International Joint Conference on Artificial Intelligence · Cited by 1,179
Letizia: an agent that assists web browsing
Lieberman, H. A. (1995) · Cited by 1,137
Large Margin Rank Boundaries for Ordinal Regression
Herbrich, R., Graepel, T., & Obermayer, K. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0010 · Cited by 1,074
International Conference on Machine Learning (ICML-99).
Scheffer, T. (1999) · Künstliche Intell. · Cited by 1,003
Learning to Classify Text Using Support Vector Machines: Methods, Theory and Algorithms
Joachims, T. (2002) · Cited by 932
Self-citationAn Efficient Boosting Algorithm for Combining Preferences
Freund, Y., Iyer, R. D., Schapire, R. E., & Singer, Y. (1998) · Cited by 806
Agglomerative clustering of a search engine query log
Beeferman, D., & Berger, A. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347176 · Cited by 768
Web Watcher: A Tour Guide for the World Wide Web.
Joachims, T., Freitag, D., & Mitchell, T. M. (1997) · Cited by 685
Self-citationAdvances in Neural Information Processing Systems 15 (NIPS 2002)
Williams, C. K. I., & Shawe-Taylor, J. S. (2002) · The MIT Press eBooks · Cited by 620
An Introduction to the Theory of Statistics
Robinson, J., & Plackett, R. L. (1974) · Biometrics · doi:10.2307/2529637 · Cited by 558
Crammer, K., & Singer, Y. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0087 · Cited by 538
Introduction to the theory of statistics
Mood, A. M., & Graybill, F. A. (1963) · CERN Document Server (European Organization for Nuclear Research) · Cited by 451
Mathematical Models in the Social Sciences.
Walters, A. A., Kemeny, J. G., & Snell, J. L. (1964) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2982303 · Cited by 365
Automatic Combination of Multiple Ranked Retrieval Systems
Bartell, B. T., Cottrell, G. W., & Belew, R. K. (1994) · SIGIR ’94 · doi:10.1007/978-1-4471-2099-5_18 · Cited by 277
Measuring retrieval effectiveness based on user preference of documents
Yao, Y. Y. (1995) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199503)46:2<133::aid-asi6>3.0.co;2-z · Cited by 258
Mathematical models in the social sciences
Snell, J. L., & Kemeny, J. G. (1972) · Cited by 222
Measuring retrieval effectiveness based on user preference of documents
YaoY., Y. (1995) · Journal of the American Society for Information Science and Technology · doi:10.5555/208098.208105 · Cited by 180
Robust Trainability of Single Neurons
Höffgen, K.-U., Simon, H. U., & VanHorn, K. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1011 · Cited by 153
Optimum polynomial retrieval functions based on the probability ranking principle
Fuhr, N. (1989) · ACM Transactions on Information Systems · doi:10.1145/65943.65944 · Cited by 145
A Machine Learning Architecture for Optimizing Web Search Engines
Boyan, J. A., & Freitag, D. (1999) · Cited by 130
AIR/X - A rule-based multistage indexing system for Iarge subject fields.
Fuhr, N., Hartmann, S., Lustig, G., Schwantner, M., Tzeras, K., & Knorz, G. (1991) · Cited by 101
AAAI-96 Workshop on Internet-Based Information Systems
Franz, A. (1997) · AI Magazine · Cited by 31
(1998)
Cited by
Rendle, S. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.127 · Cited by 3,189
Real-World Anomaly Detection in Surveillance Videos
Sultani, W., Chen, C., & Shah, M. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00678 · Cited by 2,140
Learning to rank: from pairwise approach to listwise approach
Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273513 · Cited by 1,960
Training linear SVMs in linear time
Joachims, T. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150429 · Cited by 1,920
Self-citationLearning to rank for information retrieval
Liu, T.-Y. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835676 · Cited by 1,856
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.