Graph Invariant Kernels

We introduce a novel kernel that upgrades the Weisfeiler-Lehman and other graph kernels to effectively exploit highdimensional and continuous vertex attributes. Graphs are first decomposed into subgraphs. Vertices of the subgraphs are then compared by a kernel that combines the similarity of their labels and the similarity of their structural role, using a suitable vertex invariant. By changing this invariant we obtain a family of graph kernels which includes generalizations of Weisfeiler-Lehman, NSPDK, and propagation kernels. We demonstrate empirically that these kernels obtain state-ofthe-art results on relational data sets.

Authors

• Francesco Orsini
• Paolo Frasconi
• Luc De Raedt KU Leuven Örebro University

Keywords

No keywords are indexed for this paper.