Erratum: Statistical properties of kernel principal component analysis (Machine Learing DOI: 10.1007/s10994-006-6895-9);Statistical properties of kernel principal component analysis

Machine Learning

Volumn 66, Issue 2-3, 2007, Pages 259-294

  Blanchard, Gilles ^a   Bousquet, Olivier ^b   Zwald, Laurent ^c  

^a FRAUNHOFER FIRST   (Germany)

^b Pertinence   (France)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Covariance operator; Fast convergence rates; Kernel integral operator; Kernel principal components analysis; Kernel spectrum estimation

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; ERROR ANALYSIS; HILBERT SPACES; MATHEMATICAL OPERATORS; STATISTICAL METHODS;

COVARIANCE OPERATORS; FAST CONVERGENCE RATES; KERNEL ALGORITHMS; KERNEL INTEGRAL OPERATORS; KERNEL PRINCIPAL COMPONENTS ANALYSIS; RECONSTRUCTION ERRORS;

PRINCIPAL COMPONENT ANALYSIS;

EID: 33847676413     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-006-8886-2     Document Type: Erratum

References (26)

1. Anderson, T. W. (1963). Asymptotic theory for principal component analysis. Annals of Mathematical Statistics, 34, 122-148.
2. Aronszajn, N. (1950). Theory of reproducing kernels. Transactions of the American Mathematical Society, 68, 337-404.
3. Bach, F., & Jordan, M. (2002). Kernel independent component analysis. Journal of Machine Learning Research, 3, 1-48.
4. Bartlett, P., Bousquet, O., & Mendelson, S. (2005). Local Rademacher complexities. Annals of Statistics, 33(4), 1497-1537.
5. Bartlett, P., Jordan, M., & McAuliffe, J. (2003). Convexity, classification, and risk bounds. Technical report, Department of Statistics, U.C. Berkeley, To appear in J.A.S.A.
6. Baxendale, P. (1976). Gaussian measures on function spaces. American Journal of Mathematics, 98, 891-952.
7. Besse, P. (1979). Etude descriptive d'un processus; approximation, interpolation. PhD thesis, Université de Toulouse.
8. Besse, P. (1991). Approximation spline de l'analyse en composantes principales d'une variable aléatoire hilbertienne. Annals of Faculty of Science Toulouse (Mathematics), 12(5), 329-349.
9. Bousquet, O. (2002). Concentration inequalities and empirical processes theory applied to the analysis of learning algorithms. PhD thesis, Ecole Polytechnique.
10. Braun, M. (2005). Spectral properties of the kernel matrix and their relation to kernel methods in machine learning. PhD thesis, Friedrich-Wilhelms- Universität Bonn, Available at http://hss.ulb.uni-bonn.de/diss_online/ math_nat_fak/2005/braun_mikio.
11. Dauxois, J., & Pousse, A. (1976). Les analyses factorielles en calcul des probabilités et en statistique: essai d'étude synthétique. PhD thesis, Université de Toulouse.
12. de la Peña, V. H., & Giné, E. (1999) Decoupling: From dependence to independence. Springer.
13. Dunford, N., & Schwartz, J. T. (1963). Linear operators part II: Spectral theory, self adjoint operators in Hilbert space. Number VII in Pure and Applied Mathematics. New York: John Wiley & Sons.
14. Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58, 13-30.
15. Koltchinskii, V. (2004). Local rademacher complexities and oracle inequalities in risk minimization. Technical report, Department of mathematics and statistics, University of New Mexico.
16. Koltchinskii, V., & Giné, E. (2000). Random matrix approximation of spectra of integral operators. Bernoulli, 6(1), 113-167.
17. Massart, P. (2000). Some applications of concentration inequalities to statistics. Annales de la Faculté des Sciences de Toulouse, IX, 245-303.
18. Maurer, A. (2004) Concentration of Hilbert-Schmidt operators and applications to feature learning. Manuscript.
19. McDiarmid, C. (1989). On the method of bounded differences. Surveys in combinatorics (pp. 148-188). Cambridge University Press.
20. Mendelson, S., & Pajor, A. (2005). Ellipsoid approximation with random vectors. In P. Auer, & R. Meir, (Eds.), Proceedings of the 18th annual conference on learning theory (COLT 05) of lecture notes in computer science, vol. 3559 (pp. 429-433). Springer.
21. Ramsay, J. O., & Dalzell, C. J. (1991). Some tools for functional data analysis. Journal of the Royal Statistical Society, Series B, 53(3), 539-572.
22. Schölkopf, B., Smola, A. J., & Müller, K.-R. (1999) Kernel principal component analysis. In B. Schölkopf, C. J. C. Burges, & A. J. Smola, (Eds.), Advances in kernel methods - Support vector learning (pp. 327-352). Cambridge, MA: MIT Press. Short version appeared in Neural Computation, 10, 1299-1319, 1998.
23. Shawe-Taylor, J., Williams, C., Cristianini, N., & Kandola, J. (2002). Eigenspectrum of the Gram matrix and its relationship to the operator eigenspectrum. In Algorithmic Learning Theory: 13th International Conference, ALT 2002 of lecture notes in computer science, vol. 2533 (pp. 23-40). Springer-Verlag.
24. Shawe-Taylor, J., Williams, C., Cristianini, N., & Kandola, J. (2005). On the eigenspectrum of the Gram matrix and the generalisation error of kernel PCA. IEEE Transactions on Information Theory 51, (7), 2510-2522.
25. Williams, C. K. I., & Seeger, M. (2000). The effect of the input density distribution on kernel-based classifiers. In P. Langley, editor, Proceedings of the 17th international conference on machine learning (pp. 1159-1166), San Francisco, California: Morgan Kaufmann.
26. Williamson, R. C., Smola, A. J., & Schölkopf, B. (2001). Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators. IEEE Transactions on Information Theory, 47(6), 2516-2532.