Sample complexity of classifiers taking values in ℝq, application to multi-class SVMs

Communications in Statistics - Theory and Methods

Volumn 39, Issue 3, 2010, Pages 543-557

  Guermeur, Yann ^a  

^a LORIA   (France)

Author keywords

Generalized VC dimensions; Multi class support vector machines; Rademacher complexity; Sample complexity

Indexed keywords

CLASSIFICATION ,; MULTI-CLASS; MULTI-CLASS SUPPORT VECTOR MACHINES; RADEMACHER COMPLEXITY; SAMPLE COMPLEXITY; STATISTICAL LEARNING THEORY; VC DIMENSION;

SUPPORT VECTOR MACHINES;

STOCHASTIC MODELS;

EID: 74549209083     PISSN: 03610926     EISSN: 1532415X     Source Type: Journal    
DOI: 10.1080/03610920903140288     Document Type: Article

References (18)

1. Alon, N., Ben-David, S., Cesa-Bianchi, N., Haussler, D. (1997). Scale-sensitive dimensions, uniform convergence, and learnability. Journal of the ACM 44(4):615-631.
2. Bartlett, P. L. (1998). The sample complexity of pattern classification with neural networks: The size of the weights is more important than the size of the network. IEEE Transactions on Information Theory 44(2):525-536.
3. Bartlett, P. L., Shawe-Taylor, J. (1999). Generalization performance of support vector machines and other pattern classifiers. In: Schölkopf, B., Burges, C. J. C., Smola, A., eds. Advances in Kernel Methods, Support Vector Learning. Ch. 4, Cambridge, MA: The MIT Press, pp. 43-54.
4. Ben-David, S., Cesa-Bianchi, N., Haussler, D., Long, P. M. (1995). Characterizations of learnability for classes of 0n-valued functions. Journal of Computer and System Sciences 50(1):74-86.
5. Berlinet, A., Thomas-Agnan, C. (2004). Reproducing Kernel Hilbert Spaces in Probability and Statistics. Boston: Kluwer Academic Publishers.
6. Boucheron, S., Bousquet, O., Lugosi, G. (2005). Theory of classification: A survey of some recent advances. ESAIM: Probability and Statistics 9:323-375.
7. Crammer, K., Singer, Y. (2001). On the algorithmic implementation of multiclass kernelbased vector machines. Journal of Machine Learning Research 2:265-292.
8. Dudley, R. M. (1984). A course on empirical processes. In: Hennequin, P. L., ed. Ecole d'Eté de Probabilités de Saint-Flour XII-1982. Vol.1097 of Lecture Notes in Mathematics. Springer-Verlag, pp. 1-142.
9. Guermeur, Y. (2004). Large margin multi-category discriminant models and scale-sensitive--dimensions. Technical Report RR-5314. INRIA. (Revised in 2006).
10. Guermeur, Y., Maumy, M., Sur, F. (2005). Model selection for multi-class SVMs. International Symposium on Applied Stochastic Models and Data Analysis. Brest, France, pp. 507-517.
11. Kearns, M. J., Schapire, R. E. (1994). Efficient distribution-free learning of probabilistic concepts. Journal of Computer and System Sciences 48(3):464-497.
12. Lee, Y., Lin, Y., Wahba, G. (2004). Multicategory support vector machines: Theory and application to the classification of microarray data and satellite radiance data. Journal of the American Statistical Association 99(465):67-81.
13. McDiarmid, C. (1989). On the method of bounded differences. Surveys in Combinatorics 141:148-188.
14. Natarajan, B. K. (1989). On learning sets and functions. Machine Learning 4(1):67-97.
15. Sauer, N. (1972). On the density of families of sets. Journal of Combinatorial Theory (A) 13:145-147.
16. Shawe-Taylor, J., Cristianini, N. (2004). Kernel Methods for Pattern Analysis. Cambridge: Cambridge University Press.
17. Vapnik, V. N. (1998). Statistical Learning Theory. New York: John Wiley & Sons, Inc.
18. Weston, J., Watkins, C. (1998). Multi-class support vector machines. Technical Report CSDTR-98-104 Department of Computer Science, Royal Holloway, University of London.