By combining practical relevance with novel types of prediction problems, the learning from/of preferences has recently received a lot of attention in the machine learning literature. Just as other types of complex learning tasks, preference learning deviates strongly from the standard problems of classification and regression. It is particularly challenging because it involves the prediction of complex structures, such as weak or partial order relations, rather than single values. This article aims at conveying a first idea of typical preference learning problems. To this end, two particular learning scenarios will be sketched, namely learning from label preferences and learning from object preferences. Both scenarios can be handled in two fundamentally different ways: by evaluating individual candidates (using a utility function) or by comparing competing candidates (using a binary “is preferred to” predicate).
[1]
Gerald Tesauro,et al.
Connectionist Learning of Expert Preferences by Comparison Training
,
1988,
NIPS.
[2]
Dan Roth,et al.
Constraint Classification: A New Approach to Multiclass Classification
,
2002,
ALT.
[3]
K. Obermayer,et al.
Supervised learning of preference relations
,
1998
.
[4]
Jon Doyle,et al.
Prospects for Preferences
,
2004,
Comput. Intell..
[5]
Eyke Hüllermeier,et al.
Pairwise Preference Learning and Ranking
,
2003,
ECML.
[6]
Yoram Singer,et al.
Learning to Order Things
,
1997,
NIPS.
[7]
Thorsten Joachims,et al.
Optimizing search engines using clickthrough data
,
2002,
KDD.