Ranking the best instances - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2007

Ranking the best instances

Abstract

We formulate the local ranking problem in the framework of bipartite ranking where the goal is to focus on the best instances. We propose a methodology based on the construction of real-valued scoring functions. We study empirical risk minimization of dedicated statistics which involve empirical quantiles of the scores. We first state the problem of finding the best instances which can be cast as a classification problem with mass constraint. Next, we develop special performance measures for the local ranking problem which extend the Area Under an ROC Curve (AUC/AROC) criterion and describe the optimal elements of these new criteria. We also highlight the fact that the goal of ranking the best instances cannot be achieved in a stage-wise manner where first, the best instances would be tentatively identified and then a standard AUC criterion could be applied. Eventually, we state preliminary statistical results for the local ranking problem.
Fichier principal
Vignette du fichier
rankingthebest_subrev.pdf (322.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00111670 , version 1 (06-11-2006)
hal-00111670 , version 2 (13-02-2007)

Identifiers

Cite

Stéphan Clémençon, Nicolas Vayatis. Ranking the best instances. 2007. ⟨hal-00111670v2⟩
126 View
253 Download

Altmetric

Share

Gmail Facebook X LinkedIn More