Transductive learning to rank using association rules
► We propose a transductive method for learning to rank. ► We design a loss function to incorporate the information from labeled and unlabeled data. ► The experimental results show that our method outperforms the supervised baseline. Learning to rank, a task to learn ranking functions to sort a set...
Gespeichert in:
Veröffentlicht in: | Expert systems with applications 2011-09, Vol.38 (10), p.12839-12844 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | ► We propose a transductive method for learning to rank. ► We design a loss function to incorporate the information from labeled and unlabeled data. ► The experimental results show that our method outperforms the supervised baseline.
Learning to rank, a task to learn ranking functions to sort a set of entities using machine learning techniques, has recently attracted much interest in information retrieval and machine learning research. However, most of the existing work conducts a supervised learning fashion. In this paper, we propose a transductive method which extracts paired preference information from the unlabeled test data. Then we design a loss function to incorporate this preference data with the labeled training data, and learn ranking functions by optimizing the loss function via a derived Ranking SVM framework. The experimental results on the LETOR 2.0 benchmark data collections show that our transductive method can significantly outperform the state-of-the-art supervised baseline. |
---|---|
ISSN: | 0957-4174 1873-6793 |
DOI: | 10.1016/j.eswa.2011.04.076 |