Ranking and scoring using empirical risk minimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3559 LNAI, Issue , 2005, Pages 1-15

  Clémençon, Stéphan ^a,c   Lugosi, Gábor ^b   Vayatis, Nicolas ^c  

^a UNIVERSITÉ PARIS OUEST NANTERRE LA DÉFENSE   (France)

^b DEPARTMENT OF ECONOMICS AND BUSINESS   (Spain)

^c SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; LEARNING SYSTEMS; RISK ASSESSMENT; STATISTICAL METHODS;

EMPIRICAL MINIMIZATION; NATURAL ESTIMATES; RISK MINIMIZERS; SUPPORT VECTOR MACHINES;

RISK MANAGEMENT;

EID: 26944450515     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11503415_1     Document Type: Conference Paper

References (23)

1. S. Agarwal, T. Graepel, R. Herbrich, and D. Roth (2004). A large deviation bound for the area under the ROC curve. In Proceedings of the 18th Annual Conference on Neural Information Processing Systems, Vancouver, Canada.
2. S. Agarwal, S. Har-Peled, and D. Roth (2005). A uniform convergence bound for the area under the ROC curve. In Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics, Barbados.
3. M.A. Arcones and E. Giné (1994). U-processes indexed by Vapnik-Chervonenkis classes of functions with applications to asymptotics and bootstrap of U-statistics with estimated parameters. Stochastic Processes and their Applications, 52, pp. 17-38.
4. P.L. Bartlett, M.I. Jordan, and J.D. McAuliffe (2003). Convexity, classification, and risk bounds. Technical Report 638, Department of Statistics, U.C. Berkeley.
5. P.L. Bartlett and S. Mendelson (2003). Empirical minimization. Technical Report, Department of Statistics, U.C. Berkeley.
6. G. Blanchard, G. Lugosi, and N. Vayatis (2003). On the rate of convergence of regularized boosting classifiers. Journal of Machine Learning Research, 4:861-894.
7. O. Bousquet, S. Boucheron, and G. Lugosi (2004). Theory of classification: a survey of recent advances. ESAIM: Probability and Statistics, to appear.
8. L. Breiman (2004). Population theory for boosting ensembles. Annals of Statistics, 32, pp. 1-11.
9. V. de la Peña and E. Giné (1999). Decoupling: from dependence to independence. Springer.
10. L. Devroye, L. Györfi, and G. Lugosi (1996). A Probabilistic Theory of Pattern Recognition. Springer-Verlag, New York.
11. Y. Freund, R. Iyer, R.E. Schapire, and Y. Singer (2003). An Efficient Boosting Algorithm for Combining Preferences. Journal of Machine Learning Research, 4, pp. 933-969.
12. D. Haussler (1995). Sphere packing numbers for subsets of the boolean n-cube with bounded Vapnik-Chervonenkis dimension. Journal of Combinatorial Theory, Series A, 69, pp. 217-232.
13. R. Herbrich, T. Graepel, and K. Obermayer (2000). Large margin rank boundaries for ordinal regression. In A. Smola, P.L. Bartlett, B.Schölkopf, and D.Schuurmans (eds.), Advances in Large Margin Classifiers, The MIT Press, pp. 115-132.
14. W. Hoeffding (1963). Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58, pp. 13-30.
15. W. Jiang (2004). Process consistency for Adaboost (with discussion). Annals of Statistics, 32, pp. 13-29.
16. V. Koltchinskii and D. Panchenko (2002). Empirical margin distribution and bounding the generalization error of combined classifiers. Annals of Statistics, 30, pp. 1-50.
17. G. Lugosi (2002). Pattern classification and learning theory. In L. Györfi (editor), Principles of Nonparametric Learning, Springer, Wien, New York, pp. 1-56.
18. G. Lugosi and N. Vayatis (2004). On the Bayes-risk consistency of boosting methods (with discussion). Annals of Statistics, 32, pp. 30-55.
19. P. Massart and E. Nédélec (2003). Risk bounds for statistical learning. Preprint, Université Paris XL
20. C. McDiarmid (1989). On the method of bounded differences. In Surveys in Combinatorics 1989, pp. 148-188, Cambridge University Press.
21. R.J. Serfling (1980). Approximation theorems of mathematical statistics. John Wiley & Sons.
22. A. Tsybakov (2004). Optimal aggregation of classifiers in statistical learning. Annals of Statistics, 32, pp. 135-166.
23. T. Zhang (2004). Statistical behavior and consistency of classification methods based on convex risk minimization (with discussion). Annals of Statistics, 32, pp. 56-85.