2011 LearningtoRankforInformationRet
- (Li, 2011) ⇒ Hang Li. (2011). “Learning to Rank for Information Retrieval and Natural Language Processing.” Morgan & Claypool Publishers. ISBN:1608457079, 9781608457076 doi:10.2200/S00607ED2V01Y201410HLT026
Subject Headings: Learning-to-Rank Algorithm; Learning for Ranking Creation; Learning for Ranking Aggregation; Methods of Learning to Rank.
Notes
Cited By
- http://scholar.google.com/scholar?q=%222011%22+Learning+to+Rank+for+Information+Retrieval+and+Natural+Language+Processing
- http://dl.acm.org/citation.cfm?id=2018740&preflayout=flat#citedby
Quotes
Abstract
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.
References
;
Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
---|---|---|---|---|---|---|---|---|---|---|
2011 LearningtoRankforInformationRet | Hang Li | Learning to Rank for Information Retrieval and Natural Language Processing | 10.2200/S00607ED2V01Y201410HLT026 | 2011 |