publication . Conference object . 2011

Bipartite Ranking through Minimization of Univariate Loss

Kotlowski, Wojciech; Dembczynski, K.; Huellermeier, E.;
Open Access English
  • Published: 01 Jul 2011
Abstract
Minimization of the rank loss or, equivalently, maximization of the AUC in bipartite ranking calls for minimizing the number of disagreements between pairs of instances. Since the complexity of this problem is inherently quadratic in the number of training examples, it is tempting to ask how much is actually lost by minimizing a simple univariate loss function, as done by standard classification methods, as a surrogate. In this paper, we first note that minimization of 0/1 loss is not an option, as it may yield an arbitrarily high rank loss. We show, however, that better results can be achieved by means of a weighted (cost-sensitive) version of 0/1 loss. Yet, th...
Download from
NARCIS
Conference object . 2011
Provider: NARCIS
Any information missing or wrong?Report an Issue