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
An improved spectral clustering algorithm based on local neighbors in kernel space
Xinyue Liu,Xing Yong,Hongfei Lin +2 more
TL;DR: Experiments have shown that spectral clustering based on linear reconstruction in kernel space outperforms the conventional spectral clustered and the other two algorithms, especially in real world data sets.
SupernoVAE : VAE based kernel PCA for analysis of spatio-temporal Earth data
Xavier-Andoni Tibau,Christian Requena-Mesa,Christian Reimers,Joachim Denzler,Veronika Eyring,Markus Reichstein,Jakob Runge +6 more
- 01 Jan 2018
TL;DR: A framework that makes use of a convolutional variational autoencoder as a learnable kernel from which to extract spatio-temporal dynamics via PCA promises the ability of deep learning to digest highly complex spatio/temporal datasets while allowing expert interpretability.
10
Regularization and Kernelization of the Maximin Correlation Approach
TL;DR: The proposed regularization and kernelization make the proposed regularized MCA more robust and accurate for various classification tasks than the original MCA, and when the data size or dimensionality grows, R-MCA runs substantially faster by solving either the primal or dual of the QCLP.
Effective diagnosis of Alzheimer’s disease by means of large margin-based methodology
R. Chaves,Javier Ramírez,Juan Manuel Górriz,Ignacio A. Illán,Manuel Gómez-Río,Cristobal Carnero +5 more
TL;DR: One of the advances is the robustness of the LMNN algorithm that not only provides higher separation rate between the classes but it also makes (in combination with NMSE and PLS) this rate variation more stable.
fMRI Activation Network Analysis Using Bose-Einstein Entropy
Jianjia Wang,Richard C. Wilson,Edwin R. Hancock +2 more
- 29 Nov 2016
TL;DR: A novel method for characterizing networks using the entropy associated with bosonic particles in thermal equilibrium with a heat-bath and whether the resulting entropy can be used to construct an effective information theoretic graph-kernel for the purposes of classifying different types of graph or network structure is presented.
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