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
Fast Fisher Sparsity Preserving Projections
TL;DR: This paper proposes two novel efficient dimensionality reduction methods named Fast Sparsity Preserving Projections (FSPP) and Fast Fisher Sparsity preserves (FFSPP), respectively, which aim to preserve the sparse representation structure in high-dimensional data.
14
Maximal Similarity Embedding
TL;DR: A new global linear algorithm is proposed in this paper, which is named Maximal Similarity Embedding (MSE), which is robust for sparse dataset and naturally helps in avoiding the problem of small sample size cases.
14
Application of multidimensional scaling to quantify shape in Alzheimer's disease and its correlation with Mini Mental State Examination: A feasibility study
Hyunjin Park,Jongbum Seo +1 more
TL;DR: A novel method for quantifying shape information based on multidimensional scaling (MDS), a well-known statistical tool, that was shown to correlate with the Mini Mental State Examination (MMSE) and better performance results compared with using the volume of hippocampus as basis for classification.
14
Dimensionality reduction, and function approximation of poly(lactic-co-glycolic acid) micro- and nanoparticle dissolution rate.
TL;DR: In this article, dimensionality reduction techniques were applied in order to simplify the task and eliminate irrelevant and redundant features, and several ensemble methods were tested to improve the accuracy of prediction.
Local distances preserving based manifold learning
TL;DR: The proposed method of calculating the embedded data points in LDP and SLDP has less complexity than the similar local manifold learning methods, Laplacian eigenmaps (LEM) and stochastic LEM (SLEM).
14
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