Skip to main navigation Skip to search Skip to main content

Ranking the best instances

  • CNRS LTCI
  • Université Paris-Saclay

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)2671-2699
Number of pages29
JournalJournal of Machine Learning Research
Volume8
Publication statusPublished - 1 Dec 2007
Externally publishedYes

Keywords

  • Empirical risk minimization
  • Fast rates
  • ROC curve and AUC
  • Ranking

Fingerprint

Dive into the research topics of 'Ranking the best instances'. Together they form a unique fingerprint.

Cite this