Adaptive estimation of the optimal ROC curve and a bipartite ranking algorithm

Stéphan Clémençon, Nicolas Vayatis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we propose an adaptive algorithm for bipartite ranking and prove its statistical performance in a stronger sense than the AUC criterion. Our procedure builds on and significantly improves the RankOver algorithm proposed in [1]. The algorithm outputs a piecewise constant scoring rule which is obtained by overlaying a finite collection of classifiers. Here, each of these classifiers is the empirical solution of a specific minimum-volume set (MV-set) estimation problem. The major novelty arises from the fact that the levels of the MV-sets to recover are chosen adaptively from the data to adjust to the variability of the target curve. The ROC curve of the estimated scoring rule may be interpreted as an adaptive spline approximant of the optimal ROC curve. Error bounds for the estimate of the optimal ROC curve in terms of the L-distance are also provided.

Original languageEnglish
Title of host publicationAlgorithmic Learning Theory - 20th International Conference, ALT 2009, Proceedings
Pages216-231
Number of pages16
DOIs
Publication statusPublished - 1 Dec 2009
Externally publishedYes
Event20th International Conference on Algorithmic Learning Theory, ALT 2009 - Porto, Portugal
Duration: 3 Oct 20095 Oct 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5809 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th International Conference on Algorithmic Learning Theory, ALT 2009
Country/TerritoryPortugal
CityPorto
Period3/10/095/10/09

Fingerprint

Dive into the research topics of 'Adaptive estimation of the optimal ROC curve and a bipartite ranking algorithm'. Together they form a unique fingerprint.

Cite this