Ranking the best instances

Journal of Machine Learning Research

Volumn 8, Issue , 2007, Pages 2671-2699

  Clémençon, Stéphan ^a   Vayatis, Nicolas ^b  

^a INSTITUT TELECOM   (France)

^b école normale supérieure Paris Saclay   (France)

Author keywords

Empirical risk minimization; Fast rates; Ranking; ROC curve and AUC

Indexed keywords

OPTIMAL SYSTEMS; PROBLEM SOLVING;

BIPARTITE RANKING PROBLEMS; EMPIRICAL RISKS; REAL VALUED SCORING FUNCTIONS;

STATISTICS;

EID: 37749025853     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (41)

1. S. Agarwal, T. Graepel, R. Herbrich, S. Har-Peled, and D. Roth. Generalization bounds for the area under the ROC curve. Journal of Machine Learning Research, 6:393-425, 2005.
2. P. Bartlett, M. Jordan, and J. McAuliffe. Convexity, classification, and risk bounds. Journal of the American Statistical Association, 101(473):138-156, 2006.
3. S. Boucheron, O. Bousquet, and G. Lugosi. Theory of classification: A survey of some recent advances. ESAIM: Probability and Statistics, 9:323-375, 2005.
4. L. Cavalier. Nonparametric estimation of regression level sets. Statistics, 29:131-160, 1997.
5. S. Clémençon, G. Lugosi, and N. Vayatis. Ranking and scoring using empirical risk minimization. In P. Auer and R. Meir, editors, Proceedings of COLT 2005, volume 3559 of Lecture Notes in Computer Science, pages 1-15. Springer, 2005.
6. S. Clémençon, G. Lugosi, and N. Vayatis. Ranking and empirical risk minimization of U-statistics. The Annals of Statistics, To appear.
7. C. Cortes and M. Mohri. Auc optimization vs. error rate minimization. In S. Thrun, L. Saul, and B. Schölkopf, editors, Advances in Neural Information Processing Systems 16. MIT Press, Cambridge, MA, 2004.
8. D. Cossock and T. Zhang. Statistical analysis of Bayes optimal subset ranking. Technical report, Yahoo! Research, 2006.
9. L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer, 1996.
10. L. E. Dodd and M. S. Pepe. Partial AUC estimation and regression. Biometrics, 59(3):614-623, 2003.
11. R.M. Dudley. Uniform Central Limit Theorems. Cambridge University Press, 1999.
12. V. Dupac and J. Hájek. Asymptotic normality of simple linear rank statistics under alternatives ii. The Annals of Mathematical Statistics, (6):1992-2017, 1969.
13. J.P. Egan. Signal Detection Theory and ROC Analysis. Academic Press, 1975.
14. Y. Freund, R. D. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 2003.
15. J. Hájek and Z. Sidák. Theory of Rank Tests. Academic Press, 1967.
16. J.A. Hanley and J. McNeil. The meaning and use of the area under a ROC curve. Radiology, (143):29-36, 1982.
17. K. Järvelin and J. Kekäläinen. IR evaluation methods for retrieving highly relevant documents. In N.J. Belkin, P. Ingwersen, , and M.-K. Leong, editors, Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 41-48, 2000.
18. H.L. Koul. Weighted Empirical Processes in Dynamic Nonlinear Models, volume 166 of Lecture Notes in Statistics. Springer, 2nd edition, 2002.
19. H.L. Koul. Some convergence theorems for ranks and weighted empirical cumulatives. The Annals of Mathematical Statistics, (41):1768-1773, 1970.
20. H.L. Koul and Jr. R.G. Staudte. Weak convergence of weighted empirical cumulatives based on ranks. The Annals of Mathematical Statistics, (43):823-841, 1972.
21. P. Li, C. Burges, and Q. Wu. Learning to rank using classification and gradient boosting. Technical report MSR-TR-2007-74, Microsoft Research, 2007.
22. G. Lugosi. Pattern classification and learning theory. In L. Györfi, editor, Principles of Nonparametric Learning, pages 1-56.
23. E. Mammen and A. B. Tsybakov. Smooth discrimination analysis. Annals of Statistics, 27(6):1808-1829, 1999.
24. P. Massart. Concentration Inequalities and Model Selection. Lecture Notes in Mathematics. Springer, 2006.
25. P. Massart and E. Nédélec. Risk bounds for statistical learning. Annals of Statistics, 34(5), 2006.
26. A. Papoulis. Probability, Random Variables, and Stochastic Processes. McGraw-Hill, 1965.
27. C. Rudin. Ranking with a P-Norm Push. In H.U. Simon and G. Lugosi, editors, Proceedings of COLT 2006, volume 4005 of Lecture Notes in Computer Science, pages 589-604, 2006.
28. C. Rudin, C. Cortes, M. Mohri, and R. E. Schapire. Margin-based ranking and boosting meet in the middle. In P. Auer and R. Meir, editors, Proceedings of COLT 2005, volume 3559 of Lecture Notes in Computer Science, pages 63-78. Springer, 2005.
29. C. Scott. Performance measures for Neyman-Pearson classification. Technical report, Department of Statistics, Rice University, 2005.
30. C. Scott and M. Davenport. Regression level set estimation via cost-sensitive classification. IEEE Transactions on Signal Processing, 2006, to appear.
31. C. Scott and R. Nowak. A Neyman-Pearson approach to statistical learning. IEEE Transactions on Information Theory, 51(11):3806-3819, November 2005.
32. C. Scott and R. Nowak. Learning minimum volume sets. Journal of Machine Learning Research, 7:665-704, April 2006.
33. I. Steinwart, D. Hush, and C. Scovel. A classification framework for anomaly detection. Journal of Machine Learning Research, 6:211-232, 2005.
34. J. Taylor and R. Tibshirani. A tail strength measure for assessing the overall univariate significance in a dataset. Biostatistics, 7(2):167-181, 2006.
35. A. Tsybakov. Optimal aggregation of classifiers in statistical learning. Annals of Statistics, 32(1):135-166, 2004.
36. A. Tsybakov. On nonparametric estimation of density level sets. Annals of Statistics, 25(3):948-969, 1997.
37. S. van de Geer. Empirical Processes in M-Estimation. Cambridge University Press, 2000.
38. A. van de Vaart. Asymptotic Statistics. Cambridge University Press, 1998.
39. H.L. van Trees. Detection, Estimation, and Modulation Theory, Part I. John Wiley, 1968.
40. R. Vert and J.-P. Vert. Consistency and convergence rates of one-class SVMs and related algorithms. Journal of Machine Learning Research, 7:817-854, May 2006.
41. R. Willett and R. Nowak. Minimax optimal level set estimation. Technical report, Rice University, 2006.