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

Authors:
Stéphan Clémençon;Nicolas Vayatis
Affiliations:
LTCI, Telecom Paristech, TSI, UMR, Institut Telecom, CNRS;CMLA, ENS Cachan & UniverSud, UMR, CNRS, Cachan cedex, France
Venue:
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Year:
2009

Citing 5
Cited 1

Interpolation of operators

Interpolation of operators
An efficient boosting algorithm for combining preferences

The Journal of Machine Learning Research
Generalization Bounds for the Area Under the ROC Curve

The Journal of Machine Learning Research
Learning Minimum Volume Sets

The Journal of Machine Learning Research
A Neyman-Pearson approach to statistical learning

IEEE Transactions on Information Theory

Ranking data with ordinal labels: optimality and pairwise aggregation

Machine Learning

Quantified Score

Hi-index	0.00

Visualization

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.