Paper Title
Introducing The Partial Label Ranking Problem

Abstract
The Label Ranking (LR) problem is a well-known non-standard supervised classification problem, whose goal is to predict a total order (i.e. a permutation) among the labels the class variable can take. In this paper, we deal with a more flexible approach, the Partial Label Ranking (PLR) problem, where weak orders are considered instead of permutations, namely, ties are allowed when there is no preference among the labels. Keywords - Label Ranking Problem, Partial Label Ranking Problem, Instance-Based Learning, Decision Trees.