Graph Kernels Exploiting Weisfeiler-Lehman Graph Isomorphism Test Extensions

Giovanni Da San Martino, Nicolò Navarin, Alessandro Sperduti

Abstract

In this paper we present a novel graph kernel framework inspired the by the Weisfeiler-Lehman (WL) isomorphism tests. Any WL test comprises a relabelling phase of the nodes based on test-specific information extracted from the graph, for example the set of neighbours of a node. We defined a novel relabelling and derived two kernels of the framework from it. The novel kernels are very fast to compute and achieve state-of-the-art results on five real-world datasets.
BibTeX
@inproceedings{martino2014graph,
  author = {Giovanni Da San Martino and Nicolò Navarin and Alessandro Sperduti},
  title = {{Graph Kernels Exploiting Weisfeiler-Lehman Graph Isomorphism Test Extensions}},
  booktitle = {ICONIP},
  year = {2014},
  doi = {10.1007/978-3-319-12640-1\_12},
}

Loading related content...

Figure