Skip to Main content Skip to Navigation
Journal articles

Ranking the Best Instances

Abstract : We formulate a local form of the bipartite ranking problem 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) 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.
Complete list of metadatas

Cited literature [41 references]  Display  Hide  Download

https://hal.telecom-paris.fr/hal-02107152
Contributor : Stephan Clémençon <>
Submitted on : Monday, February 3, 2020 - 11:04:20 AM
Last modification on : Friday, July 31, 2020 - 11:28:03 AM

Identifiers

  • HAL Id : hal-02107152, version 1

Citation

Stéphan Clémençon, Nicolas Vayatis. Ranking the Best Instances. Journal of Machine Learning Research, Microtome Publishing, 2007, 8, pp.2671 - 2699. ⟨hal-02107152⟩

Share

Metrics

Record views

44