Learning from Label Preferences
Abstract
In this paper, we review the framework of learning (from) label preferences, a particular instance of preference learning. Following an introduction to the learning setting, we particularly focus on our own work, which addresses this problem via the learning by pairwise comparison paradigm. From a machine learning point of view, learning by pairwise comparison is especially appealing as it decomposes a possibly complex prediction problem into a certain number of learning problems of the simplest type, namely binary classification. We also discuss how a number of common machine learning tasks, such as multi-label classification, hierarchical classification or ordinal classification, may be addressed within the framework of learning from label preferences. We also briefly address theoretical questions as well as algorithmic and complexity issues.
Cite
Text
Hüllermeier and Fürnkranz. "Learning from Label Preferences." International Conference on Algorithmic Learning Theory, 2011. doi:10.1007/978-3-642-24412-4_5Markdown
[Hüllermeier and Fürnkranz. "Learning from Label Preferences." International Conference on Algorithmic Learning Theory, 2011.](https://mlanthology.org/alt/2011/hullermeier2011alt-learning/) doi:10.1007/978-3-642-24412-4_5BibTeX
@inproceedings{hullermeier2011alt-learning,
title = {{Learning from Label Preferences}},
author = {Hüllermeier, Eyke and Fürnkranz, Johannes},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2011},
pages = {38},
doi = {10.1007/978-3-642-24412-4_5},
url = {https://mlanthology.org/alt/2011/hullermeier2011alt-learning/}
}