Label ranking algorithms: A survey

80Citations
Citations of this article
102Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Label ranking is a complex prediction task where the goal is to map instances to a total order over a finite set of predefined labels. An interesting aspect of this problem is that it subsumes several supervised learning problems, such as multiclass prediction, multilabel classification, and hierarchical classification. Unsurprisingly, there exists a plethora of label ranking algorithms in the literature due, in part, to this versatile nature of the problem. In this paper, we survey these algorithms. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Vembu, S., & Gärtner, T. (2011). Label ranking algorithms: A survey. In Preference Learning (pp. 45–64). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-14125-6_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free