articleJul 23, 2007Closed access

AdaRank

Microsoft Research Asia (China)

Indexed incrossref

Abstract

In this paper we address the issue of learning to rank for document retrieval. In the task, a model is automatically created with some training data and then is utilized for ranking of documents. The goodness of a model is usually evaluated with performance measures such as MAP (Mean Average Precision) and NDCG (Normalized Discounted Cumulative Gain). Ideally a learning algorithm would train a ranking model that could directly optimize the performance measures with respect to the training data. Existing methods, however, are only able to train ranking models by minimizing loss functions loosely related to the performance measures. For example, Ranking SVM and RankBoost train ranking models by minimizing…

Citation impact

782
total citations
FWCI
107.04
Percentile
100%
References
37
Citations per year

Authors

2

Topics & keywords

Keywords
  • Ranking SVM
  • Computer science
  • Learning to rank
  • Ranking (information retrieval)
  • Machine learning
  • Boosting (machine learning)
  • Artificial intelligence
  • Benchmark (surveying)
No related works found for this paper.