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
•Proceedings Article
Compressive spectral embedding: sidestepping the SVD
Dinesh Ramasamy,Upamanyu Madhow +1 more
- 07 Dec 2015
TL;DR: This paper proposes a low-complexity compressive spectral embedding algorithm, which employs random projections and finite order polynomial expansions to compute approximations to SVD-based embedding, and demonstrates the efficacy of the proposed method on network datasets.
•Proceedings Article
Aligned Graph Classification with Regularized Logistic Regression.
Brian Quanz,Jun Huan +1 more
- 01 Jan 2009
TL;DR: To incorporate the feature relationship, logistic regression is extended and a regularization term is used that includes the normalized Laplacian of the graph, similar to the L2 regularization, deriving a modified optimization problem and solution.
13
A comparison study on nonlinear dimension reduction methods with kernel variations: Visualization, optimization and classification
Katherine C. Kempfert,Yishi Wang,Cuixian Chen,Samuel W. K. Wong +3 more
- 01 Jan 2020
TL;DR: The computational approach can be applied to practical gender classification systems and generalized to other face analysis tasks, such as race classification and age prediction, and faster processing speeds and similar recognition rates on MORPH-II.
An experimental study of graph classification using prototype selection
Andreas Fischer,Kaspar Riesen,Horst Bunke +2 more
- 01 Jan 2008
TL;DR: It is demonstrated that the proposed graph embedding in conjunction with standard classifiers from statistical pattern recognition has great potential to outperform classification methods applied in the original graph domain.
13
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