LETOR: A benchmark collection for research on learning to rank for information retrieval

被引:268
作者
Qin, Tao [1 ]
Liu, Tie-Yan [1 ]
Xu, Jun [1 ]
Li, Hang [1 ]
机构
[1] Microsoft Res Asia, Beijing, Peoples R China
来源
INFORMATION RETRIEVAL | 2010年 / 13卷 / 04期
关键词
Learning to rank; Information retrieval; Benchmark datasets; Feature extraction;
D O I
10.1007/s10791-009-9123-y
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
LETOR is a benchmark collection for the research on learning to rank for information retrieval, released by Microsoft Research Asia. In this paper, we describe the details of the LETOR collection and show how it can be used in different kinds of researches. Specifically, we describe how the document corpora and query sets in LETOR are selected, how the documents are sampled, how the learning features and meta information are extracted, and how the datasets are partitioned for comprehensive evaluation. We then compare several state-of-the-art learning to rank algorithms on LETOR, report their ranking performances, and make discussions on the results. After that, we discuss possible new research topics that can be supported by LETOR, in addition to algorithm comparison. We hope that this paper can help people to gain deeper understanding of LETOR, and enable more interesting research projects on learning to rank and related topics.
引用
收藏
页码:346 / 374
页数:29
相关论文
共 51 条
[1]  
[Anonymous], P 29 ANN INT ACM SIG
[2]  
[Anonymous], 2005, INT C MACH LEARN
[3]  
[Anonymous], 2003, Journal of machine learning research
[4]  
[Anonymous], 2002, P ACM SIGKDD KDD 200, DOI 10.1145/775047.775067
[5]  
[Anonymous], 2008, Advances in Neural Information Processing Systems NIPS
[6]  
[Anonymous], SIGIR 2008
[7]  
[Anonymous], 2008, P 31 ANN INT ACM SIG, DOI 10.1145/1390334.1390356
[8]  
[Anonymous], 2007, Uci machine learning repository
[9]  
Baeza-Yates R, 1999, MODERN INFORM RETRIE, V463
[10]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117