Listwise Learning to Rank by Exploring Structure of Objects
Authors:
- 9 March 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 28 (7) , 1934-1939
Abstract
Listwise learning to rank (LTR) is aimed at constructing a ranking model from listwise training data to order objects. In most existing studies, each training instance consists of a set of objects described by preference features. In a preference feature space for the objects in training, the structure of the objects is associated with the absolute preference degrees for the objects. The degrees significantly influence the ordering of the objects. Nevertheless, the structure of the training objects in their preference feature space has rarely been studied. In addition, most listwise LTR algorithms yield a single linear ranking model for all objects, but this ranking model may be insufficient to capture the underlying nonlinear ranking mechanism among all objects. This study proposes a divide-and-train method to learn a nonlinear ranking model from listwise training data. First, a rank-preserving clustering approach is used to infer the structure of objects in their preference feature space and all the objects in training data are divided into several clusters. Each cluster is assumed to correspond to a preference degree and an ordinal regression function is then learned. Second, considering that relations exist among the clusters, a multi-task listwise ranking approach is then employed to train linear ranking functions for all the clusters (or preference degrees) simultaneously. Our proposed method utilizes both the (relative) preferences among objects and the intrinsic structure of objects. Experimental results on benchmark data sets suggest that the proposed method outperforms state-oft-the-art listwise LTR algorithms.Keywords
Funding Information
- NSFC (61379098)
This publication has 20 references indexed in Scilit:
- Clustering and projected clustering with adaptive neighbors2014
- Listwise approaches based on feature ranking discoveryFrontiers of Computer Science, 2012
- Top-k learning to rank2012
- Efficient Clustering Aggregation Based on Data FragmentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2012
- A Multimedia Retrieval Framework Based on Semi-Supervised Ranking and Relevance FeedbackIEEE Transactions on Pattern Analysis and Machine Intelligence, 2011
- Learning a Mahalanobis distance metric for data clustering and classificationPattern Recognition, 2008
- AdaRank2007
- Learning to rank2007
- Cost-Sensitive Learning of SVM for Ranking2006
- Regularized multi--task learning2004