Properties of kernels

John Shawe‐Taylor, Nello CristianiniCambridge 2004 · DOI · OpenAlex

Abstract

As we have seen in Chapter 2, the use of kernel functions provides a powerful and principled way of detecting nonlinear relations using well-understood linear algorithms in an appropriate feature space. The approach decouples the design of the algorithm from the specification of the feature space. This inherent modularity not only increases the flexibility of the approach, it also makes both the learning algorithms and the kernel design more amenable to formal analysis. Regardless of which pattern analysis algorithm is being used, the theoretical properties of a given kernel remain the same. It is the purpose of this chapter to introduce the properties that characterise kernel functions.
BibTeX
@inproceedings{shawetaylor2004properties,
  author = {John Shawe‐Taylor and Nello Cristianini},
  title = {{Properties of kernels}},
  booktitle = {Cambridge},
  year = {2004},
  doi = {10.1017/cbo9780511809682.004},
}

Loading related content...

Figure