By Topic

On the eigenspectrum of the gram matrix and the generalization error of kernel-PCA

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
J. Shawe-Taylor ; Sch. of Electron. & Comput. Sci., Univ. of Southampton, UK ; C. K. I. Williams ; N. Cristianini ; J. Kandola

In this paper, the relationships between the eigenvalues of the m×m Gram matrix K for a kernel κ(·,·) corresponding to a sample x1,...,xm drawn from a density p(x) and the eigenvalues of the corresponding continuous eigenproblem is analyzed. The differences between the two spectra are bounded and a performance bound on kernel principal component analysis (PCA) is provided showing that good performance can be expected even in very-high-dimensional feature spaces provided the sample eigenvalues fall sufficiently quickly.

Published in:

IEEE Transactions on Information Theory  (Volume:51 ,  Issue: 7 )