Learning to Rank for Information Retrieval

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Due to the fast growth of the Web and the difficulties in finding desired information, efficient and effective information retrieval systems have become more important than ever, and the search engine has become an essential tool for many people.

The ranker, a central component in every search engine, is responsible for the matching between processed queries and indexed documents. Because of its central role, great attention has been paid to the research and development of ranking technologies. In addition, ranking is also pivotal for many other information retrieval applications, such as collaborative filtering, definition ranking, question answering, multimedia retrieval, text summarization, and online advertisement. Leveraging machine learning technologies in the ranking process has led to innovative and more effective ranking models, and eventually to a completely new research area called “learning to rank”.

Liu first gives a comprehensive review of the major approaches to learning to rank. For each approach he presents the basic framework, with example algorithms, and he discusses its advantages and disadvantages. He continues with some recent advances in learning to rank that cannot be simply categorized into the three major approaches – these include relational ranking, query-dependent ranking, transfer ranking, and semisupervised ranking. His presentation is completed by several examples that apply these technologies to solve real information retrieval problems, and by theoretical discussions on guarantees for ranking performance.

This book is written for researchers and graduate students in both information retrieval and machine learning. They will find here the only comprehensive description of the state of the art in a field that has driven the recent advances in search engine development.

Author(s): Tie-Yan Liu (auth.)
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2011

Language: English
Commentary: preprint version
Pages: 285
Tags: Information Storage and Retrieval; Artificial Intelligence (incl. Robotics); Probability and Statistics in Computer Science; Pattern Recognition

Front Matter....Pages I-XVII
Front Matter....Pages 1-1
Introduction....Pages 3-30
Front Matter....Pages 31-31
The Pointwise Approach....Pages 33-47
The Pairwise Approach....Pages 49-70
The Listwise Approach....Pages 71-88
Analysis of the Approaches....Pages 89-99
Front Matter....Pages 101-101
Relational Ranking....Pages 103-111
Query-Dependent Ranking....Pages 113-121
Semi-supervised Ranking....Pages 123-126
Transfer Ranking....Pages 127-130
Front Matter....Pages 131-131
The LETOR Datasets....Pages 133-143
Experimental Results on LETOR....Pages 145-152
Other Datasets....Pages 153-155
Front Matter....Pages 157-157
Data Preprocessing for Learning to Rank....Pages 159-179
Applications of Learning to Rank....Pages 181-191
Front Matter....Pages 193-193
Statistical Learning Theory for Ranking....Pages 195-200
Statistical Ranking Framework....Pages 201-209
Generalization Analysis for Ranking....Pages 211-222
Statistical Consistency for Ranking....Pages 223-231
Front Matter....Pages 233-233
Summary....Pages 235-240
Future Work....Pages 241-248
Front Matter....Pages 249-249
Mathematical Background....Pages 251-266
Machine Learning....Pages 267-282
Back Matter....Pages 283-285