Learning to Rank for Information Retrieval and Natural Language Processing, Second Edition

被引:0
作者
Li, Hang [1 ]
机构
[1] Huawei Technologies, China
来源
Synthesis Lectures on Human Language Technologies | 2015年 / 7卷 / 03期
关键词
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/S00607ED2V01Y201410HLT026
中图分类号
学科分类号
摘要
Download Free Sample Learning to rank refers to machine learning techniques for training a 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 its problems recently, and significant progress has been made. This lecture gives an introduction to the area including the fundamental problems, major 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 based, and Neural Network based approaches. The author also introduces some popular learning to rank methods in details. These include: PRank, OC SVM, McRank, Ranking SVM, IR SVM, GBRank, RankNet, ListNet & ListMLE, AdaRank, SVM MAP, SoftRank, LambdaRank, LambdaMART, 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. © 2011 by Morgan & Claypool.
引用
收藏
页码:1 / 123
页数:122
相关论文
共 126 条
[41]  
Gao J., Qi H., Xia X., Nie J.-Y., Linear discriminant model for information retrieval, SIGIR, pp. 290-297, (2005)
[42]  
Gao W., Cai P., Wong K.-F., Zhou A., Learning to rank only using training data from related domain, Proceeding of the 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '10, pp. 162-169, (2010)
[43]  
Geng X., Liu T.-Y., Qin T., Arnold A., Li H., Shum H.-Y., Query dependent ranking using k-nearest neighbor, SIGIR 08: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 115-122, (2008)
[44]  
Geng X., Liu T.-Y., Qin T., Li H., Feature selection for ranking, SIGIR 07: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 407-414, (2007)
[45]  
Guiver J., Snelson E., Learning to rank with softrank and Gaussian processes, SIGIR 08: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 259-266, (2008)
[46]  
Guiver J., Snelson E., Bayesian inference for plackett-luce ranking models, ICML 09: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 377-384, (2009)
[47]  
Gyongyi Z., Garcia-Molina H., Pedersen J., Combating web spam with trustrank, Proceedings of the Thirtieth International Conference on Very Large Data Bases Volume 30, VLDB '04, pp. 576-587, (2004)
[48]  
Harrington E.F., Online ranking/collaborative filtering using the perceptron algorithm, ICML, 78, pp. 250-257, (2003)
[49]  
Herbrich R., Graepel T., Obermayer K., Support Vector Learning for Ordinal Regression, (1999)
[50]  
Herbrich R., Graepel T., Obermayer K., Large Margin Rank Boundaries for Ordinal Regression, 26, 37, (2000)