Semigroup Kernels on Measures
Abstract
We present a family of positive definite kernels on measures, characterized by the fact that the value of the kernel between two measures is a function of their sum. These kernels can be used to derive kernels on structured objects, such as images and texts, by representing these objects as sets of components, such as pixels or words, or more generally as measures on the space of components. Several kernels studied in this work make use of common quantities defined on measures such as entropy or generalized variance to detect similarities. Given an a priori kernel on the space of components itself, the approach is further extended by restating the previous results in a more efficient and flexible framework using the "kernel trick". Finally, a constructive approach to such positive definite kernels through an integral representation theorem is proved, before presenting experimental results on a benchmark experiment of handwritten digits classification to illustrate the validity of the approach.
Cite
Text
Cuturi et al. "Semigroup Kernels on Measures." Journal of Machine Learning Research, 2005.Markdown
[Cuturi et al. "Semigroup Kernels on Measures." Journal of Machine Learning Research, 2005.](https://mlanthology.org/jmlr/2005/cuturi2005jmlr-semigroup/)BibTeX
@article{cuturi2005jmlr-semigroup,
title = {{Semigroup Kernels on Measures}},
author = {Cuturi, Marco and Fukumizu, Kenji and Vert, Jean-Philippe},
journal = {Journal of Machine Learning Research},
year = {2005},
pages = {1169-1198},
volume = {6},
url = {https://mlanthology.org/jmlr/2005/cuturi2005jmlr-semigroup/}
}