Support Vector methods in learning and feature extraction
Bernhard Schölkopf, Müller K-R Smola Aj, Vapnik et al. · 1998
The last years have witnessed an increasing interest in Support Vector (SV) machines, which use Mercer kernels for efficiently performing computations in high-dimensional spaces. In pattern recognition, the SV algorithm constructs nonlinear decision functions by training a classifier to perform a linear separation in some high-dimensional space which is nonlinearly related to input space. Recently, we have developed a technique for Nonlinear Principal Component Analysis (Kernel PCA) based on the same types of kernels. This way, we can for instance efficiently extract polynomial features of arbitrary order by computing projections onto principal components in the space of all products of n pixels of images. We explain the idea of Mercer kernels and associated feature spaces, and describe connections to the theory of reproducing kernels and to regularization theory, followed by an overview of the above algorithms employing these kernels. 1. Introduction For the case of two-class pattern...
Cited by 32 works.
Authors
References
- Support-Vector Networks
- A training algorithm for optimal margin classifiers
- A Tutorial on Support Vector Machines for Pattern Recognition
- Text categorization with Support Vector Machines: Learning with many relevant features
- Boosting the margin: a new explanation for the effectiveness of voting methods
- Nonlinear Component Analysis as a Kernel Eigenvalue Problem
- Theoretical Foundations of the Potential Function Method in Pattern Recognition Learning
- Comparing support vector machines with Gaussian kernels to radial basis function classifiers
- The connection between regularization operators and support vector kernels
- Predicting time series with support vector machines