Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm

@inproceedings{Clmenon2009AdaptiveEO,
  title={Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm},
  author={St{\'e}phan Cl{\'e}mençon and Nicolas Vayatis},
  booktitle={ALT},
  year={2009}
}
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 the RankOver algorithm proposed in (Clémençon & Vayatis, 2008a). 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 main… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Tree-structured ranking rules and approximation of the optimal ROC curve

S. Clémençon, N. Vayatis
ALT ’08: Proceedings of the 2008 conference on Algorithmic Learning Theory. Budapest, Hungary • 2008
View 18 Excerpts
Highly Influenced

Tree-structured ranking rules and approximation of the optimal ROC curve (Technical Report hal-00268068). HAL

S. Clémençon, N. Vayatis
2008
View 18 Excerpts
Highly Influenced

Nonlinear approximation

View 2 Excerpts
Highly Influenced

A note on adaptive approximation

R. Devore
Approx. Theory Appl., • 1987
View 3 Excerpts
Highly Influenced

Interpolation of Operators on L-spaces

NATHALIE TASSOTTI
2008
View 1 Excerpt

Ranking and empirical risk minimization of U-statistics

S. Clémençon, G. Lugosi, N. Vayatis
The Annals of Statistics, • 2008
View 2 Excerpts

A Neyman-Pearson approach to statistical learning

IEEE Transactions on Information Theory • 2005
View 1 Excerpt

Similar Papers

Loading similar papers…