 | 2009 |
| 14 |  | Stéphan Clémençon,
Nicolas Vayatis:
Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm.
ALT 2009: 216-231 |
| 13 |  | Odalric-Ambrym Maillard,
Nicolas Vayatis:
Complexity versus Agreement for Many Views.
ALT 2009: 232-246 |
| 12 |  | Stéphan Clémençon,
Nicolas Vayatis:
Nonparametric estimation of the precision-recall curve.
ICML 2009: 24 |
| 2008 |
| 11 |  | Stéphan Clémençon,
Nicolas Vayatis:
Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm.
ALT 2008: 22-37 |
| 10 |  | Patrice Bertail,
Stéphan Clémençon,
Nicolas Vayatis:
On Bootstrapping the ROC Curve.
NIPS 2008: 137-144 |
| 9 |  | Stéphan Clémençon,
Nicolas Vayatis:
Empirical performance maximization for linear rank statistics.
NIPS 2008: 305-312 |
| 8 |  | Stéphan Clémençon,
Nicolas Vayatis:
Overlaying classifiers: a practical approach for optimal ranking.
NIPS 2008: 313-320 |
| 2005 |
| 7 |  | Stéphan Clémençon,
Gábor Lugosi,
Nicolas Vayatis:
Ranking and Scoring Using Empirical Risk Minimization.
COLT 2005: 1-15 |
| 6 |  | Stéphan Clémençon,
Gábor Lugosi,
Nicolas Vayatis:
From Ranking to Classification: A Statistical View.
GfKl 2005: 214-221 |
| 5 |  | Anatoli Juditsky,
Alexander V. Nazin,
Alexandre B. Tsybakov,
Nicolas Vayatis:
Generalization Error Bounds for Aggregation by Mirror Descent with Averaging.
NIPS 2005 |
| 2003 |
| 4 |  | Gilles Blanchard,
Gábor Lugosi,
Nicolas Vayatis:
On the Rate of Convergence of Regularized Boosting Classifiers.
Journal of Machine Learning Research 4: 861-894 (2003) |
| 2002 |
| 3 |  | Gábor Lugosi,
Nicolas Vayatis:
A Consistent Strategy for Boosting Algorithms.
COLT 2002: 303-318 |
| 2000 |
| 2 |  | Nicolas Vayatis:
The Role of Critical Sets in Vapnik-Chervonenkis Theory.
COLT 2000: 75-80 |
| 1999 |
| 1 |  | Nicolas Vayatis,
Robert Azencott:
Distribution-Dependent Vapnik-Chervonenkis Bounds.
EuroCOLT 1999: 230-240 |