The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
AdaRank: a boosting algorithm for information retrieval
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.
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
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
(1999) · Cited by 12,854
Baeza-Yates, R. A., & Ribeiro-Neto, B. A. (1999) · Cited by 11,505
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884 · cited 1×
“Extensions have been made to deal with the problems of multi-class classification [10, 26], regression [7], and ranking [8].”
MethodOptimizing search engines using clickthrough data
Joachims, T. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775067 · Cited by 3,873
Learning to rank using gradient descent
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102363 · Cited by 2,836
Improved boosting algorithms using confidence-rated predictions
Schapire, R. E., & Singer, Y. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279960 · Cited by 2,547
A Language Modeling Approach to Information Retrieval
Ponte, J. M., & Croft, W. B. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130368 · Cited by 2,503
Boosting the margin: a new explanation for the effectiveness of voting methods
Bartlett, P., Freund, Y., Lee, W. S., & Schapire, R. E. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691352 · Cited by 2,306
Improved Boosting Algorithms Using Confidence-rated Predictions
Schapire, R. E., & Singer, Y. (1999) · Machine Learning · doi:10.1023/a:1007614523901 · Cited by 1,971
A language modeling approach to information retrieval
Ponte, J. M., & Croft, W. B. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.291008 · Cited by 1,821
IR evaluation methods for retrieving highly relevant documents
Järvelin, K., & Kekäläinen, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130374 · Cited by 1,444
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
IR evaluation methods for retrieving highly relevant documents
Järvelin, K., & Kekäläinen, J. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345545 · Cited by 967
A support vector method for multivariate performance measures
Joachims, T. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102399 · Cited by 786
Document Language Models, Query Models, and Risk Minimization for Information Retrieval
Lafferty, J., & Zhai, C. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130375 · Cited by 754
(2006) · doi:10.7551/mitpress/7503.003.0029 · Cited by 753
Boosting the margin: A new explanation for the effectiveness of voting methods
Schapire, R. E., Freund, Y., Barlett, P., & Lee, W. S. (1997) · Cited by 711
Adapting ranking SVM to document retrieval
Cao, Y., Xu, J., Liu, T.-Y., Li, H., Huang, Y., & Hon, H.-W. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148205 · Cited by 569
Self-citationDocument language models, query models, and risk minimization for information retrieval
Lafferty, J., & Zhai, C. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.383970 · Cited by 530
Discriminative models for information retrieval
Nallapati, R. (2004) · Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1008992.1009006 · Cited by 285
Subset Ranking Using Regression
Cossock, D., & Zhang, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11776420_44 · Cited by 236
Boosting Methods for Regression
Duffy, N., & Helmbold, D. (2002) · Machine Learning · doi:10.1023/a:1013685603443 · Cited by 183
The TREC-9 Filtering Track Final Report.
Robertson, S. E., & Hull, D. A. (2000) · Cited by 168
Overview of the TREC 2003 Web Track.
Craswell, N., Hawking, D., Wilkinson, R. G., & Wu, M. (2002) · Text REtrieval Conference · Cited by 153
SVM selective sampling for ranking with application to data retrieval
Yu, H. (2005) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1081870.1081911 · Cited by 120
Trotman, A. (2005) · Information Retrieval · doi:10.1007/s10791-005-6991-7 · Cited by 111
A study of relevance propagation for web search
Qin, T., Liu, T., Zhang, X., Chen, Z., & Ma, W. (2005) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1076034.1076105 · Cited by 104
Exploiting the hierarchical structure for link analysis
Xue, G.-R., Yang, Q., Zeng, H.-J., Yu, Y., & Chen, Z. (2005) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1076034.1076068 · Cited by 95
Microsoft Research Asia at Web Track and Terabyte Track of TREC 2004.
Song, R., Wen, J.-R., Shi, S., Xin, G., Liu, T., Qin, T., Zheng, X., Zhang, J., Xue, G.-R., & Ma, W. (2004) · Text REtrieval Conference · Cited by 51
Cost-Sensitive Learning of SVM for Ranking
Xu, J., Cao, Y., Li, H., & Huang, Y. (2006) · Lecture notes in computer science · doi:10.1007/11871842_86 · Cited by 33
Self-citationLearning Rankings via Convex Hull Separation
Fung, G., Rosales, R., & Krishnapuram, B. (2005) · Cited by 31
Direct Maximization of Rank-Based Metrics for Information Retrieval
Metzler, D., Croft, W. B., & McCallum, A. (2005) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 20
Cited by
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
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
Learning to Rank for Information Retrieval
Liu, T.-Y. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000016 · Cited by 1,568
Reciprocal rank fusion outperforms condorcet and individual rank learning methods
Cormack, G. V., Clarke, C. L. A., & Buettcher, S. (2009) · Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1571941.1572114 · Cited by 797
“AdaRank-MAP [ 6 ] 0.5778 (0.55 - 0.61) 0.0273 (0.01 - 0.04) .000”
InfluentialListwise approach to learning to rank: theory and algorithm
Xia, F., Liu, T.-Y., Wang, J., Zhang, W., & Li, H. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390306 · Cited by 702
Self-citation
Metadata
- Authors
- Xu, J., & Li, H.
- Venue
- Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 2007-07-23
- Pages
- 391-398
- OpenAlex
- W2142537246
- Cited by
- 775
- References
- 35
- FWCI
- 30.78
- 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.