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
•Posted Content
Data-dependent compression of random features for large-scale kernel approximation
TL;DR: The authors proposed to combine the simplicity and generality of RFMs with a data-dependent feature selection scheme to achieve desirable theoretical approximation properties of Nystrom with just O(log J+) features.
9
•Posted Content
Roweis Discriminant Analysis: A Generalized Subspace Learning Method.
TL;DR: Theoretical analysis explains previously known facts such as why SPCA can use regression but FDA cannot, why PCA and SPC a have duals but FDA does not, why kernel PC a and kernel SPCa use kernel trick but kernel FDAdoes not, and why PC a is the best linear method for reconstruction.
9
•Proceedings Article
Cover song identification with metric learning using distance as a feature
Hoon Heo,Hyunwoo Kim,Wan-Soo Kim,Kyogu Lee +3 more
- 01 Jan 2017
TL;DR: This paper presents a novel approach to tackle the cover song identification problem from a new perspective that does not depend on the computation method for the pairwise distance, and thus can use any existing algorithms.
9
Mitigating the curse of dimensionality using feature projection techniques on electroencephalography datasets: an empirical review
TL;DR: This empirical review assesses 23 dimensionality reduction techniques to mitigate the curse of dimensionality in EEG feature sets, evaluating their impact on AI-based classifiers, and identifies PCA+t-SNE as a hybrid technique achieving 93.36% average accuracy in EEG analysis.
9
Characterizing Transient Radio-Frequency Interference†
TL;DR: In this article, a dataset of the time domain RFI signals of nine typical transient RFI sources was collected and analyzed using principal components analysis (PCA) and kernel PCA.
9
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