Kernel methods in machine learning
Data61 · Max Planck Institute for Biological Cybernetics
Abstract
We review machine learning methods employing positive definite kernels. These methods formulate learning and estimation problems in a reproducing kernel Hilbert space (RKHS) of functions defined on the data domain, expanded in terms of a kernel. Working in linear spaces of function has the benefit of facilitating the construction and analysis of learning algorithms while at the same time allowing large classes of functions. The latter include nonlinear functions as well as functions defined on nonvectorial data. We cover a wide range of methods, ranging from binary classifiers to sophisticated methods for estimation with structured data.
Citation impact
- FWCI
- 26.43
- Percentile
- 100%
- References
- 116
Authors
3- THThomas HofmannCorresponding
Data61
- BSBernhard Schölkopf
- AJAlexander J. Smola
Data61, Max Planck Institute for Biological Cybernetics
Topics & keywords
- Reproducing kernel Hilbert space
- Kernel (algebra)
- Kernel method
- Hilbert space
- Binary classification
- Range (aeronautics)
- Kernel embedding of distributions
- Representer theorem