User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse




Conference Paper

The Kernel Trick for Distances


Schölkopf,  B
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;

There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available

Schölkopf, B. (2001). The Kernel Trick for Distances. Advances in Neural Information Processing Systems 13, 301-307.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-E2B4-3
A method is described which, like the kernel trick in support vector machines (SVMs), lets us generalize distance-based algorithms to operate in feature spaces, usually nonlinearly related to the input space. This is done by identifying a class of kernels which can be represented as norm-based distances in Hilbert spaces. It turns out that the common kernel algorithms, such as SVMs and kernel PCA, are actually really distance based algorithms and can be run with that class of kernels, too. As well as providing a useful new insight into how these algorithms work, the present work can form the basis for conceiving new algorithms.