DeepAI AI Chat
Log In Sign Up

Faster Kernels for Graphs with Continuous Attributes via Hashing

by   Christopher Morris, et al.
TU Dortmund

While state-of-the-art kernels for graphs with discrete labels scale well to graphs with thousands of nodes, the few existing kernels for graphs with continuous attributes, unfortunately, do not scale well. To overcome this limitation, we present hash graph kernels, a general framework to derive kernels for graphs with continuous attributes from discrete ones. The idea is to iteratively turn continuous attributes into discrete labels using randomized hash functions. We illustrate hash graph kernels for the Weisfeiler-Lehman subtree kernel and for the shortest-path kernel. The resulting novel graph kernels are shown to be, both, able to handle graphs with continuous attributes and scalable to large graphs and data sets. This is supported by our theoretical analysis and demonstrated by an extensive experimental evaluation.


page 1

page 2

page 3

page 4


Propagation Kernels

We introduce propagation kernels, a general graph-kernel framework for e...

Learning Convolutional Neural Networks for Graphs

Numerous important problems can be framed as learning from graph data. W...

Graph Kernels: State-of-the-Art and Future Challenges

Graph-structured data are an integral part of many application domains, ...

A Survey on Graph Kernels

Graph kernels have become an established and widely-used technique for s...

Taming graph kernels with random features

We introduce in this paper the mechanism of graph random features (GRFs)...

Provenance Graph Kernel

Provenance is a record that describes how entities, activities, and agen...

RetGK: Graph Kernels based on Return Probabilities of Random Walks

Graph-structured data arise in wide applications, such as computer visio...