Graph Filtration Kernels

The majority of popular graph kernels is based on the concept of Haussler’s R-convolution kernel and defines graph similarities in terms of mutual substructures. In this work, we enrich these similarity measures by considering graph filtrations: Using meaningful orders on the set of edges, which allow to construct a sequence of nested graphs, we can consider a graph at multiple granularities. A key concept of our approach is to track graph features over the course of such graph resolutions. Rather than to simply compare frequencies of features in graphs, this allows for their comparison in terms of when and for how long they exist in the sequences. In this work, we propose a family of graph kernels that incorporate these existence intervals of features. While our approach can be applied to arbitrary graph features, we particularly highlight Weisfeiler-Lehman vertex labels, leading to efficient kernels. We show that using Weisfeiler-Lehman labels over certain filtrations strictly increases the expressive power over the ordinary Weisfeiler-Lehman procedure in terms of deciding graph isomorphism. In fact, this result directly yields more powerful graph kernels based on such features and has implications to graph neural networks due to their close relationship to the Weisfeiler-Lehman method. We empirically validate the expressive power of our graph kernels and show significant improvements over state-of-the-art graph kernels in terms of predictive performance on various real-world benchmark datasets.

  • Published in:
    Proceedings of the AAAI Conference on Artificial Intelligence AAAI Conference on Artificial Intelligence (AAAI)
  • Type:
  • Authors:
    T. H. Schulz, P. Welke, S. Wrobel
  • Year:

Citation information

T. H. Schulz, P. Welke, S. Wrobel: Graph Filtration Kernels, AAAI Conference on Artificial Intelligence (AAAI), Proceedings of the AAAI Conference on Artificial Intelligence, 2022,, Schulz.etal.2022a,