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 principal component analysis and support vector machines for stock price prediction
TL;DR: There is no difference between MLP networks and SVR techniques when the authors compare their mean square error values, and proposed heuristic models produce better results than the studied data mining methods.
87
Kernel orthogonal subspace projection for hyperspectral signal classification
Heesung Kwon,Nasser M. Nasrabadi +1 more
TL;DR: A kernel-based nonlinear version of the orthogonal subspace projection (OSP) operator is defined in terms of kernel functions, which is shown that the kernelized OSP method outperforms the conventional OSP approach.
87
Robust kernel principal component analysis
TL;DR: Both theoretical and numerical results indicate that the proposed robust method outperforms the conventional approach in the sense of being less sensitive to outliers and more resistant to data contamination and model deviation.
86
A methodology to compare dimensionality reduction algorithms in terms of loss of quality
TL;DR: This paper proposes a methodology that allows different DR methods to be analyzed and compared as regards the loss of quality produced by them, and makes use of the concept of preservation of geometry (quality assessment criteria) to assess the lost quality.
85
A Machine Learning Based Spatio-Temporal Data Mining Approach for Detection of Harmful Algal Blooms in the Gulf of Mexico
TL;DR: A spatio-temporal cubical neighborhood around the training sample is introduced to retrieve relevant spectral information of both HAB and non-HAB classes and Kernel based support vector machine is used as a classifier in the detection of HABs.
85
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