2010 · 1K citations · 9 references
ComputingComputer ScienceAlgorithmsData MiningMachine LearningDecision TreesEnsemble LearningEnsemble MethodsOutranking MethodsRanking ProblemsBoosted TreesLearning To RankRanking AlgorithmsRanking OptimizationTop-k Ranking
LambdaMART is the boosted tree version of LambdaRank, which is based on RankNet. RankNet, LambdaRank, and LambdaMART have proven to be very successful algorithms for solving real world ranking problems: for example an ensemble of LambdaMART rankers won Track 1 of the 2010 Yahoo! Learning To Rank Challenge. The details of these algorithms are spread across several papers and reports, and so here we give a self-contained, detailed and complete description of them. 1
9
Greedy function approximation: A gradient boosting machine.
Jerome H. Friedman · The Annals of Statistics · 2001 · 29K citations · Full text
Learning to rank using gradient descent
Chris Burges, Tal Shaked, Erin Renshaw et al. · 2005 · 2.8K citations
Expected reciprocal rank for graded relevance
Olivier Chapelle, Donald Metlzer, Ya Zhang et al. · 2009 · 839 citations
Adapting boosting for information retrieval measures
Qiang Wu, Christopher J. C. Burges, Krysta M. Svore et al. · Information Retrieval · 2009 · 572 citations · Full text