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
Near-Orthogonality Regularization in Kernel Methods.
Pengtao Xie,Barnabás Póczos,Eric P. Xing +2 more
- 01 Jan 2017
TL;DR: A family of orthogonality-promoting regularizers is defined by encouraging the Gram matrix of the RKHS functions to be close to an identity matrix where the closeness is measured by Bregman matrix divergences, and results suggest that the closer the functions are to being orthogonal, the smaller the generalization error is.
Fast, Scalable, and Accurate Algorithms for Time-Series Analysis
Ioannis Paparrizos
- 01 Jan 2018
TL;DR: Fast, Scalable, and Accurate Algorithms for Time-Series Analysis with real-time constraints are presented.
A Self-Learning Fault Diagnosis Strategy Based on Multi-Model Fusion
TL;DR: The proposed approach to detect and classify the faults in complex systems with small amounts of available data history based on the model fusion for fault detection and classification shows the effectiveness of the proposed approach compared to conventional methods.
16
•Posted Content
Unifying linear dimensionality reduction
TL;DR: This optimization framework helps elucidate some rarely discussed shortcomings of well-known methods, such as the suboptimality of certain eigenvector solutions, and suggests that the generic linear dimensionality reduction solver can move linear Dimensionality reduction toward becoming a blackbox, objective-agnostic numerical technology.
16
Manifold Learning by Graduated Optimization
Michael S. Gashler,Dan Ventura,Tony Martinez +2 more
- 01 Dec 2011
TL;DR: An empirical analysis across a wide range of manifold problems indicates that manifold sculpting yields more accurate results than a number of existing algorithms, including Isomap, locally linear embedding (LLE), Hessian LLE (HLLE), and landmark maximum variance unfolding (L-VU), and is significantly more efficient than HLLE and L-MVU.
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