Book Chapter10.1007/BFB0020217
Kernel Principal Component Analysis
Bernhard Schölkopf,Alexander J. Smola,Klaus-Robert Müller +2 more
- 08 Oct 1997
- pp 583-588
2.6K
TL;DR: A new method for performing a nonlinear form of Principal Component Analysis by the use of integral operator kernel functions is proposed and experimental results on polynomial feature extraction for pattern recognition are presented.
read more
Abstract: A new method for performing a nonlinear form of Principal Component Analysis is proposed. By the use of integral operator kernel functions, one can efficiently compute principal components in highdimensional feature spaces, related to input space by some nonlinear map; for instance the space of all possible d-pixel products in images. We give the derivation of the method and present experimental results on polynomial feature extraction for pattern recognition.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Kernel Functional Maps
TL;DR: This paper presents a kernelized version of functional maps including a recent extension in terms of pointwise multiplication operators, and provides an efficient conjugate gradient algorithm for optimizing the authors' generalized problem as well as a strategy for low‐rank estimation of kernel matrices through the Nyström approximation.
•Posted Content
On the Sample Complexity of Subspace Learning
TL;DR: In this article, the spectral properties of the covariance operator associated to the data distribu- tion were used to derive learning error estimates for principal component analysis (PCA) and spectral support estimation.
31
Credit risk evaluation with kernel-based affine subspace nearest points learning method
TL;DR: A new kernel-based learning method called kernel affine subspace nearest point (KASNP) approach is proposed for credit risk evaluation, derived from the nearest point problem of SVM, which extends the areas searched for the nearest points from the convex hulls in SVM to affines subspaces.
31
A combination of singular value decomposition and multivariate feature selection method for diagnosis of schizophrenia using fMRI
TL;DR: The proposed three-phase pattern recognition techniques to reduce the dimension of fMRI data for developing an effective computer-aided diagnosis method for schizophrenia exhibits superior performance over the existing methods.
31
Benchmarking off-the-shelf statistical shape modeling tools in clinical applications
Anupama Goparaju,Anupama Goparaju,Krithika Iyer,Krithika Iyer,Alexandre Bône,Nan Hu,Heath B. Henninger,Andrew E. Anderson,Andrew E. Anderson,Stanley Durrleman,Matthijs Jacxsens,Alan K. Morris,Ibolya Csecs,Nassir Marrouche,Shireen Y. Elhabian,Shireen Y. Elhabian +15 more
TL;DR: In this paper, the authors evaluated the performance of ShapeWorks, Deformetrica, and SPHARM-PDM models for anatomical landmark/measurement inference and lesion screening.
31
References
Support-Vector Networks
Corinna Cortes,Vladimir Vapnik +1 more
TL;DR: High generalization ability of support-vector networks utilizing polynomial input transformations is demonstrated and the performance of the support- vector network is compared to various classical learning algorithms that all took part in a benchmark study of Optical Character Recognition.
A training algorithm for optimal margin classifiers
Bernhard E. Boser,Isabelle Guyon,Vladimir Vapnik +2 more
- 01 Jul 1992
TL;DR: A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented, applicable to a wide variety of the classification functions, including Perceptrons, polynomials, and Radial Basis Functions.
Nonlinear component analysis as a kernel eigenvalue problem
TL;DR: A new method for performing a nonlinear form of principal component analysis by the use of integral operator kernel functions is proposed and experimental results on polynomial feature extraction for pattern recognition are presented.
Application of the Karhunen-Loeve procedure for the characterization of human faces
Michael Kirby,Lawrence Sirovich +1 more
TL;DR: The use of natural symmetries (mirror images) in a well-defined family of patterns (human faces) is discussed within the framework of the Karhunen-Loeve expansion, which results in an extension of the data and imposes even and odd symmetry on the eigenfunctions of the covariance matrix.
2.8K
Simplified neuron model as a principal component analyzer
TL;DR: A simple linear neuron model with constrained Hebbian-type synaptic modification is analyzed and a new class of unconstrained learning rules is derived.
2.6K