This chapter provides an overview of recent work on preference learning and ranking via pairwise classification. The learning by pairwise comparison (LPC) paradigm is the natural machine learning counterpart to the relational approach to preference modeling and decision making. From a machine learning point of view, LPC 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 explain how to approach different preference learning problems, such as label and instance ranking, within the framework of LPC. We primarily focus on methodological aspects, but also address theoretical questions as well as algorithmic and complexity issues. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Fürnkranz, J., & Hüllermeier, E. (2011). Preference learning and ranking by pairwise comparison. In Preference Learning (pp. 65–82). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-14125-6_4
Mendeley helps you to discover research relevant for your work.