Learning to Rank for Information Retrieval and Natural Language Processing

Author:   Hang Li ,  Graeme Hirst
Publisher:   Morgan & Claypool Publishers
ISBN:  

9781608457076


Pages:   113
Publication Date:   30 April 2011
Format:   Paperback
Availability:   In Print   Availability explained
Limited stock is available. It will be ordered for you and shipped pending supplier's limited stock.

Our Price $92.40 Quantity:  
Add to Cart

Share |

Learning to Rank for Information Retrieval and Natural Language Processing


Add your own review!

Overview

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.

Full Product Details

Author:   Hang Li ,  Graeme Hirst
Publisher:   Morgan & Claypool Publishers
Imprint:   Morgan & Claypool Publishers
Dimensions:   Width: 18.70cm , Height: 0.60cm , Length: 23.50cm
Weight:   0.211kg
ISBN:  

9781608457076


ISBN 10:   1608457079
Pages:   113
Publication Date:   30 April 2011
Audience:   Adult education ,  Further / Higher Education
Format:   Paperback
Publisher's Status:   Out of Print
Availability:   In Print   Availability explained
Limited stock is available. It will be ordered for you and shipped pending supplier's limited stock.

Table of Contents

Introduction Learning for Ranking Creation Learning for Ranking Aggregation Methods of Learning to Rank Applications of Learning to Rank Theory of Learning to Rank Ongoing and Future Work

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

wl

Shopping Cart
Your cart is empty
Shopping cart
Mailing List