Extensions of marginalized graph kernels


Positive definite kernels between labeled graphs have recently been proposed. They enable the application of kernel methods, such as support vector machines, to the analysis and classification of graphs, for example, chemical compounds. These graph kernels are obtained by marginalizing a kernel between paths with respect to a random walk model on the graph… (More)
DOI: 10.1145/1015330.1015446


8 Figures and Tables

Cite this paper

@inproceedings{Mah2004ExtensionsOM, title={Extensions of marginalized graph kernels}, author={Pierre Mah{\'e} and Nobuhisa Ueda and Tatsuya Akutsu and Jean-Luc Perret and Jean-Philippe Vert}, booktitle={ICML}, year={2004} }