AdaRank
Top Cited Papers
- 23 July 2007
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 391-398
- https://doi.org/10.1145/1277741.1277809
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 classification errors on instance pairs. To deal with the problem, we propose a novel learning algorithm within the framework of boosting, which can minimize a loss function directly defined on the performance measures. Our algorithm, referred to as AdaRank, repeatedly constructs 'weak rankers' on the basis of reweighted training data and finally linearly combines the weak rankers for making ranking predictions. We prove that the training process of AdaRank is exactly that of enhancing the performance measure used. Experimental results on four benchmark datasets show that AdaRank significantly outperforms the baseline methods of BM25, Ranking SVM, and RankBoost.Keywords
This publication has 19 references indexed in Scilit:
- Adapting ranking SVM to document retrievalPublished by Association for Computing Machinery (ACM) ,2006
- Subset Ranking Using RegressionLecture Notes in Computer Science, 2006
- Cost-Sensitive Learning of SVM for RankingLecture Notes in Computer Science, 2006
- SVM selective sampling for ranking with application to data retrievalPublished by Association for Computing Machinery (ACM) ,2005
- Learning to rank using gradient descentPublished by Association for Computing Machinery (ACM) ,2005
- Learning to RankInformation Retrieval Journal, 2005
- Discriminative models for information retrievalPublished by Association for Computing Machinery (ACM) ,2004
- Optimizing search engines using clickthrough dataPublished by Association for Computing Machinery (ACM) ,2002
- Additive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors)The Annals of Statistics, 2000
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997