Basic kernels and kernel types

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

Abstract

There are two key properties that are required of a kernel function for an application. Firstly, it should capture the measure of similarity appropriate to the particular task and domain, and secondly, its evaluation should require significantly less computation than would be needed in an explicit evaluation of the corresponding feature mapping ϕ. Both of these issues will be addressed in the next four chapters but the current chapter begins the consideration of the efficiency question.
BibTeX
@inproceedings{shawetaylor2004basic,
  author = {John Shawe‐Taylor and Nello Cristianini},
  title = {{Basic kernels and kernel types}},
  booktitle = {Cambridge},
  year = {2004},
  doi = {10.1017/cbo9780511809682.010},
}

Loading related content...

Figure