Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,568

The DOI matches its Crossref record; 140 of the 140 references it cites were found in a registry or an index.

Learning to Rank for Information Retrieval

Liu, Tie-Yan·2009·Foundations and Trends® in Information Retrieval

Abstract

Learning to rank for Information Retrieval (IR) is a task to automatically construct a ranking model using training data, such that the model can sort new objects according to their degrees of relevance, preference, or importance. Many IR problems are by nature ranking problems, and many IR technologies can be potentially enhanced by using learning-to-rank techniques. The objective of this tutorial is to give an introduction to this research direction. Specifically, the existing learning-to-rank algorithms are reviewed and categorized into three approaches: the pointwise, pairwise, and listwise approaches. The advantages and disadvantages with each approach are analyzed, and the relationships between the loss functions used in these approaches and IR evaluation measures are discussed. Then the empirical evaluations on typical learning-to-rank methods are shown, with the LETOR collection as a benchmark dataset, which seems to suggest that the listwise approach be the most effective one among all the approaches. After that, a statistical ranking theory is introduced, which can describe different learning-to-rank algorithms, and be used to analyze their query-level generalization abilities. At the end of the tutorial, we provide a summary and discuss potential future work on learning to rank.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1561/1500000016

Cites

140 of 140 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 140 references

Research works printed but not linked: 24

  1. Bartell, (1995), Learning to retrieve information
  2. Bousquet, (2002), Stability and generalization, The Journal of Machine Learning Research, 2, 449
  3. Burges, (2006), Learning to rank with nonsmooth cost functions, 395
  4. Carvalho, (2008), A metaleaning approach for robust rank learning
  5. Chapelle, (2007), Large margin optimization of ranking measures
  6. Cohen, (1998), Learning to order things, 243
  7. Diaz, (2007), Regularizing query-based retrieval scores, Information Retrieval, 10, 531, 10.1007/s10791-007-9034-8 · doi:10.1007/s10791-007-9034-8
  8. Freund, (2003), An efficient boosting algorithm for combining preferences, Journal of Machine Learning Research, 4, 933
  9. Gyongyi, (2004), Combating web spam with trustrank, 576
  10. Harrington, (2003), Online ranking/collaborative filtering using the perceptron algorithm, 250
  11. Herbrich, (2001), Bayes point machines, Journal of Machine Learning Research, 1, 245
  12. Hersh, (1994), OHSUMED: An interactive retrieval evaluation and new large test collection for research, 192
  13. Joachims, (2003), Text Mining, 79
  14. Li, (2003), A loss function analysis for classification methods in text categorization, 472
  15. Metzler, (2008), Machine learned sentence selection strategies for query-biased summarization
  16. Mitchell, (1997), Machine Learning
  17. Pahikkala, (2007), Learning to rank with pairwise regularized least-squares
  18. Rajaram, (2005), Generalization bounds for k-partite ranking
  19. Rigutini, (2008), Learning to rank by a neural-based sorting algorithm
  20. Rocchio, (1971), The SMART Retrieval System — Experiments in Automatic Document Processing, 313
  21. Shakery, (2006), A probabilistic relevance propagation model for hypertext retrieval, 550
  22. Tao, (2006), Regularized estimation of mixture models for robust pseudo-relevance feedback, 162, 10.1145/1148170.1148201 · doi:10.1145/1148170.1148201
  23. Xu, (2005), Ranking definitions with supervised learning methods, 811
  24. Zhai, (2008), Language models, Foundations and Trends in Information Retrieval

Cited by

Metadata

Authors
Liu, T.-Y.
Venue
Foundations and Trends® in Information Retrieval
Publisher
Emerald
Published
2009-06-27
Volume
3
Issue
3
Pages
225-331
ISSN
  • 1554-0669 (ISSN-L)
  • 1554-0677
OpenAlex
W2149427297
Cited by
1,568
References
140
FWCI
133.29
Type
journal article
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.