Learning to Rank for Information Retrieval and Natural Language Processing

被引:1
作者
Li H. [1 ]
机构
[1] Department of Microsoft, United States
来源
Synthesis Lectures on Human Language Technologies | 2011年 / 4卷 / 01期
关键词
collaborative filtering; information retrieval; learning to rank; machine translation; natural language processing; ranking; ranking aggregation; ranking creation; supervised learning; web search;
D O I
10.2200/S00348ED1V01Y201104HLT012
中图分类号
学科分类号
摘要
Learning to rank refers to machine learning techniques for training the model in a ranking task. Learning to rank is useful for many applications in information retrieval, natural language processing, and data mining. Intensive studies have been conducted on the problem recently and significant progress has been made. This lecture gives an introduction to the area including the fundamental problems, existing approaches, theories, applications, and future work. The author begins by showing that various ranking problems in information retrieval and natural language processing can be formalized as two basic ranking tasks, namely ranking creation (or simply ranking) and ranking aggregation. In ranking creation, given a request, one wants to generate a ranking list of offerings based on the features derived from the request and the offerings. In ranking aggregation, given a request, as well as a number of ranking lists of offerings, one wants to generate a new ranking list of the offerings. Ranking creation (or ranking) is the major problem in learning to rank. It is usually formalized as a supervised learning task. The author gives detailed explanations on learning for ranking creation and ranking aggregation, including training and testing, evaluation, feature creation, and major approaches. Many methods have been proposed for ranking creation. The methods can be categorized as the pointwise, pairwise, and listwise approaches according to the loss functions they employ. They can also be categorized according to the techniques they employ, such as the SVM based, Boosting SVM, Neural Network based approaches. The author also introduces some popular learning to rank methods in details. These include PRank, OC SVM, Ranking SVM, IR SVM, GBRank, RankNet, LambdaRank, ListNet & ListMLE, AdaRank, SVM MAP, SoftRank, Borda Count, Markov Chain, and CRanking. The author explains several example applications of learning to rank including web search, collaborative filtering, definition search, keyphrase extraction, query dependent summarization, and re-ranking in machine translation. A formulation of learning for ranking creation is given in the statistical learning framework. Ongoing and future research directions for learning to rank are also discussed. © 2018 by Morgan & Claypool.
引用
收藏
页码:1 / 115
页数:114
相关论文
共 116 条
[21]  
Chen W., Liu T.-Y., Ma Z.-M., Two-layer generalization analysis for ranking using rademacher average, Advances in Neural Information Processing Systems, 23, pp. 370-378, (2010)
[22]  
Cheng W., Huhn J., Hullermeier E., Decision tree and instance-based learning for label ranking, ICML '09: Proceedings of the 26th Annual International Conference On Machine Learning, pp. 161-168, (2009)
[23]  
Chu W., Ghahramani Z., Gaussian processes for ordinal regression, J. Mach. Learn. Res., 6, pp. 1019-1041, (2005)
[24]  
Chu W., Keerthi S.S., New approaches to support vector ordinal regression, ICML '05: Proceedings of the 22nd International Conference On Machine Learning, pp. 145-152, (2005)
[25]  
Stephan J., Clemencon M., Vayatis N., Empirical performance maximization for linear rank statistics, Advances in Neural Information Processing Systems, 21, pp. 305-312, (2009)
[26]  
William Cohen W., Schapire R.E., Singer Y., Learning to order things, JAIR, 10, pp. 243-270, (1999)
[27]  
Cortes C., Vapnik V., Support-vector networks, Machine Learning, 20, 3, pp. 273-297, (1995)
[28]  
Cortes C., Mohri M., Rastogi A., Magnitude-preserving ranking algorithms, ICML '07: Proceedings of the 24th International Conference On Machine Learning, pp. 169-176, (2007)
[29]  
Cossock D., Zhang T., Subset ranking using regression, COLT '06: Proceedings of the 19th Annual Conference On Learning Theory, pp. 605-619, (2006)
[30]  
Crammer K., Singer Y., Pranking with ranking, NIPS, pp. 641-647, (2001)