| 2013 | ||
|---|---|---|
| j7 | Stéphan Clémençon, Sylvain Robbiano, Nicolas Vayatis: Ranking data with ordinal labels: optimality and pairwise aggregation. Machine Learning 91(1): 67-104 (2013) | |
| 2012 | ||
| i4 | Stéphan Clémençon, Héctor de Arazoza, Fabrice Rossi, Viet-Chi Tran: Hierarchical clustering for graph visualization. CoRR abs/1210.5693 (2012) | |
| i3 | Stéphan Clémençon, Héctor de Arazoza, Fabrice Rossi, Viet-Chi Tran: Visual Mining of Epidemic Networks. CoRR abs/1210.5694 (2012) | |
| i2 | Charanpal Dhanjal, Sandrine Blanchemanche, Stéphan Clémençon, Ákos Róna-Tas, Fabrice Rossi: Dissemination of Health Information within Social Networks. CoRR abs/1211.4235 (2012) | |
| 2011 | ||
| j6 | 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) | |
| j5 | 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) | |
| c18 | Stéphan Clémençon, Héctor de Arazoza, Fabrice Rossi, Viet-Chi Tran: Hierarchical clustering for graph visualization. ESANN 2011 | |
| c17 | Sylvain Robbiano, Stéphan Clémençon: Minimax Learning Rates for Bipartite Ranking and Plug-in Rules. ICML 2011: 441-448 | |
| c16 | Till Wohlfarth, Stéphan Clémençon, François Roueff, Xavier Casellato: A Data-Mining Approach to Travel Price Forecasting. ICMLA (1) 2011: 84-89 | |
| c15 | Stéphan Clémençon, Héctor de Arazoza, Fabrice Rossi, Viet-Chi Tran: Visual Mining of Epidemic Networks. IWANN (2) 2011: 276-283 | |
| c14 | ||
| c13 | Stéphan Clémençon, Romaric Gaudel, Jérémie Jakubowicz: Clustering Rankings in the Fourier Domain. ECML/PKDD (1) 2011: 343-358 | |
| c12 | ||
| i1 | 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) | |
| 2010 | ||
| c11 | 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 | ||
| j4 | Stéphan Clémençon, Nicolas Vayatis: On Partitioning Rules for Bipartite Ranking. Journal of Machine Learning Research - Proceedings Track 5: 97-104 (2009) | |
| j3 | Stéphan Clémençon, Nicolas Vayatis: Tree-based ranking methods. IEEE Transactions on Information Theory 55(9): 4316-4336 (2009) | |
| c10 | Stéphan Clémençon, Nicolas Vayatis: Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm. ALT 2009: 216-231 | |
| c9 | Stéphan Clémençon, Nicolas Vayatis: Nonparametric estimation of the precision-recall curve. ICML 2009: 24 | |
| c8 | ||
| c7 | Stéphan Clémençon, Nicolas Vayatis, Marine Depecker: AUC optimization and the two-sample problem. NIPS 2009: 360-368 | |
| 2008 | ||
| j2 | Patrice Bertail, Stéphan Clémençon: Approximate regenerative-block bootstrap for Markov chains. Computational Statistics & Data Analysis 52(5): 2739-2756 (2008) | |
| c6 | Stéphan Clémençon, Nicolas Vayatis: Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm. ALT 2008: 22-37 | |
| c5 | Patrice Bertail, Stéphan Clémençon, Nicolas Vayatis: On Bootstrapping the ROC Curve. NIPS 2008: 137-144 | |
| c4 | Stéphan Clémençon, Nicolas Vayatis: Empirical performance maximization for linear rank statistics. NIPS 2008: 305-312 | |
| c3 | Stéphan Clémençon, Nicolas Vayatis: Overlaying classifiers: a practical approach for optimal ranking. NIPS 2008: 313-320 | |
| 2007 | ||
| j1 | Stéphan Clémençon, Nicolas Vayatis: Ranking the Best Instances. Journal of Machine Learning Research 8: 2671-2699 (2007) | |
| 2005 | ||
| c2 | Stéphan Clémençon, Gábor Lugosi, Nicolas Vayatis: Ranking and Scoring Using Empirical Risk Minimization. COLT 2005: 1-15 | |
| c1 | Stéphan Clémençon, Gábor Lugosi, Nicolas Vayatis: From Ranking to Classification: A Statistical View. GfKl 2005: 214-221 | |
Colors in the list of coauthors
Last update Wed May 22 19:14:15 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page