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
Graph-driven features extraction from microarray data
TL;DR: This paper investigates whether the knowledge of many metabolic pathways and their catalyzing enzymes accumulated over the years can help improve the performance of classiers forGene function prediction from microarray data.
28
Nonlinear supervised dimensionality reduction via smooth regular embeddings
Cem Ornek,Elif Vural +1 more
TL;DR: This work proposes a supervised manifold learning method that computes a nonlinear embedding while constructing a smooth and regular interpolation function that extends the embedding to the whole data space in order to achieve satisfactory generalization.
28
•Posted Content
Communication Efficient Distributed Kernel Principal Component Analysis
TL;DR: The algorithm is a clever combination of subspace embedding and adaptive sampling techniques, and it is shown that the algorithm can take as input an arbitrary configuration of distributed datasets, and compute a set of global kernel principal components with relative error guarantees independent of the dimension of the feature space or the total number of data points.
28
Robust dimension reduction
TL;DR: This article considers linear dimension reduction first and describes robust principal component analysis (PCA) using three approaches; the first approach uses a singular value decomposition of a robust covariance matrix, the second employs robust measures of dispersion to realize PCA as a robust projection pursuit, and the third uses a low‐rank plus sparse decomposition
28
•Posted Content
A Review of Wind Speed and Wind Power Forecasting Techniques.
Harsh S. Dhiman,Dipankar Deb +1 more
TL;DR: Wind speed forecasting applications lie majorly in the area of electricity market clearing, economic load dispatch and scheduling, and sometimes to provide ancillary support, so a proper classification based on the prediction horizon i.e. the duration of prediction becomes important for various transmission system operators.
28
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