Learning to rank: from pairwise approach to listwise approach

Abstract

The paper is concerned with learning to rank, which is to construct a model or a function for ranking objects. Learning to rank is useful for document retrieval, collaborative filtering, and many other applications. Several methods for learning to rank have been proposed, which take object pairs as 'instances' in learning. We refer to them as the pairwise approach in this paper. Although the pairwise approach offers advantages, it ignores the fact that ranking is a prediction task on list of objects. The paper postulates that learning to rank should adopt the listwise approach in which lists of objects are used as 'instances' in learning. The paper proposes a new probabilistic method for the approach. Specifically it introduces two probability models, respectively referred to as permutation probability and top <i>k</i> probability, to define a listwise loss function for learning. Neural Network and Gradient Descent are then employed as model and algorithm in the learning method. Experimental results on information retrieval show that the proposed listwise approach performs better than the pairwise approach.

DOI: 10.1145/1273496.1273513
View Slides

Extracted Key Phrases

7 Figures and Tables

050100150'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

1,132 Citations

Semantic Scholar estimates that this publication has 1,132 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Cao2007LearningTR, title={Learning to rank: from pairwise approach to listwise approach}, author={Zhe Cao and Tao Qin and Tie-Yan Liu and Ming-Feng Tsai and Hang Li}, booktitle={ICML}, year={2007} }