 | 2011 |
| 24 |  | Stéphan Clémençon,
Romaric Gaudel,
Jérémie Jakubowicz:
Clustering Rankings in the Fourier Domain.
ECML/PKDD (1) 2011: 343-358 |
| 23 |  | Stéphan Clémençon,
Héctor de Arazoza,
Fabrice Rossi,
Viet-Chi Tran:
Hierarchical clustering for graph visualization.
ESANN 2011 |
| 22 |  | Sylvain Robbiano,
Stéphan Clémençon:
Minimax Learning Rates for Bipartite Ranking and Plug-in Rules.
ICML 2011: 441-448 |
| 21 |  | Stéphan Clémençon,
Héctor de Arazoza,
Fabrice Rossi,
Viet-Chi Tran:
Visual Mining of Epidemic Networks.
IWANN (2) 2011: 276-283 |
| 20 |  | Stéphan Clémençon:
On U-processes and clustering performance.
NIPS 2011: 37-45 |
| 19 |  | Charanpal Dhanjal,
Stéphan Clémençon:
Maximising the Quality of Influence.
SDM 2011: 956-967 |
| 18 |  | Charanpal Dhanjal,
Stéphan Clémençon,
Héctor de Arazoza,
Fabrice Rossi,
Viet-Chi Tran:
The Evolution of the Cuban HIV/AIDS Network
CoRR abs/1109.2499: (2011) |
| 17 |  | Stéphan Clémençon,
Marine Depecker,
Nicolas Vayatis:
Adaptive partitioning schemes for bipartite ranking - How to grow and prune a ranking tree.
Machine Learning 83(1): 31-69 (2011) |
| 16 |  | Stéphan Clémençon,
Marine Depecker,
Nicolas Vayatis:
Avancées récentes dans le domaine de l'apprentissage d'ordonnancements.
Revue d'Intelligence Artificielle 25(3): 345-368 (2011) |
| 2010 |
| 15 |  | Stéphan Clémençon,
Jérémie Jakubowicz:
Kantorovich Distances between Rankings with Applications to Rank Aggregation.
ECML/PKDD (1) 2010: 248-263 |
| 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 |  | Stéphan Clémençon,
Nicolas Vayatis:
Nonparametric estimation of the precision-recall curve.
ICML 2009: 24 |
| 12 |  | Stéphan Clémençon,
Marine Depecker,
Nicolas Vayatis:
Bagging Ranking Trees.
ICMLA 2009: 658-663 |
| 11 |  | Stéphan Clémençon,
Nicolas Vayatis,
Marine Depecker:
AUC optimization and the two-sample problem.
NIPS 2009: 360-368 |
| 10 |  | Stéphan Clémençon,
Nicolas Vayatis:
Tree-based ranking methods.
IEEE Transactions on Information Theory 55(9): 4316-4336 (2009) |
| 9 |  | Stéphan Clémençon,
Nicolas Vayatis:
On Partitioning Rules for Bipartite Ranking.
Journal of Machine Learning Research - Proceedings Track 5: 97-104 (2009) |
| 2008 |
| 8 |  | Stéphan Clémençon,
Nicolas Vayatis:
Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm.
ALT 2008: 22-37 |
| 7 |  | Patrice Bertail,
Stéphan Clémençon,
Nicolas Vayatis:
On Bootstrapping the ROC Curve.
NIPS 2008: 137-144 |
| 6 |  | Stéphan Clémençon,
Nicolas Vayatis:
Empirical performance maximization for linear rank statistics.
NIPS 2008: 305-312 |
| 5 |  | Stéphan Clémençon,
Nicolas Vayatis:
Overlaying classifiers: a practical approach for optimal ranking.
NIPS 2008: 313-320 |
| 4 |  | Patrice Bertail,
Stéphan Clémençon:
Approximate regenerative-block bootstrap for Markov chains.
Computational Statistics & Data Analysis 52(5): 2739-2756 (2008) |
| 2007 |
| 3 |  | Stéphan Clémençon,
Nicolas Vayatis:
Ranking the Best Instances.
Journal of Machine Learning Research 8: 2671-2699 (2007) |
| 2005 |
| 2 |  | Stéphan Clémençon,
Gábor Lugosi,
Nicolas Vayatis:
Ranking and Scoring Using Empirical Risk Minimization.
COLT 2005: 1-15 |
| 1 |  | Stéphan Clémençon,
Gábor Lugosi,
Nicolas Vayatis:
From Ranking to Classification: A Statistical View.
GfKl 2005: 214-221 |