TU Darmstadt / ULB / TUbiblio

Label Ranking by Learning Pairwise Preferences

Brinker, Klaus and Fürnkranz, Johannes and Hüllermeier, Eyke (2007):
Label Ranking by Learning Pairwise Preferences.
[Online-Edition: http://www.ke.informatik.tu-darmstadt.de/publications/report...],
[Report]

Abstract

Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations. In the recent literature, the problem appears in many different guises, which we will first put into a coherent framework. This work then focuses on a particular learning scenario called label ranking, where the problem is to learn a mapping from instances to rankings over a finite number of labels. Our approach for learning such a ranking function, ranking by pairwise comparison (RPC), first induces a binary preference relation from suitable training data using a natural extension of pairwise classification. A ranking is then derived from the learned relation by means of a ranking procedure, whereby different ranking methods can be used for minimizing different loss functions. In particular, we show that (weighted) voting as a rank aggregation technique minimizes the Spearman rank correlation. Finally, we compare RPC to constraint classification, an alternative approach to label ranking, and show empirically and theoretically that RPC is computationally more efficient.

Item Type: Report
Erschienen: 2007
Creators: Brinker, Klaus and Fürnkranz, Johannes and Hüllermeier, Eyke
Title: Label Ranking by Learning Pairwise Preferences
Language: English
Abstract:

Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations. In the recent literature, the problem appears in many different guises, which we will first put into a coherent framework. This work then focuses on a particular learning scenario called label ranking, where the problem is to learn a mapping from instances to rankings over a finite number of labels. Our approach for learning such a ranking function, ranking by pairwise comparison (RPC), first induces a binary preference relation from suitable training data using a natural extension of pairwise classification. A ranking is then derived from the learned relation by means of a ranking procedure, whereby different ranking methods can be used for minimizing different loss functions. In particular, we show that (weighted) voting as a rank aggregation technique minimizes the Spearman rank correlation. Finally, we compare RPC to constraint classification, an alternative approach to label ranking, and show empirically and theoretically that RPC is computationally more efficient.

Divisions: 20 Department of Computer Science
20 Department of Computer Science > Knowl­edge En­gi­neer­ing
Date Deposited: 24 Jun 2011 15:26
Official URL: http://www.ke.informatik.tu-darmstadt.de/publications/report...
Identification Number: TUD-KE-2007-01
Export:

Optionen (nur für Redakteure)

View Item View Item