DeepAI AI Chat
Log In Sign Up

RetGK: Graph Kernels based on Return Probabilities of Random Walks

by   Zhen Zhang, et al.
Washington University in St Louis

Graph-structured data arise in wide applications, such as computer vision, bioinformatics, and social networks. Quantifying similarities among graphs is a fundamental problem. In this paper, we develop a framework for computing graph kernels, based on return probabilities of random walks. The advantages of our proposed kernels are that they can effectively exploit various node attributes, while being scalable to large datasets. We conduct extensive graph classification experiments to evaluate our graph kernels. The experimental results show that our graph kernels significantly outperform existing state-of-the-art approaches in both accuracy and computational efficiency.


page 1

page 2

page 3

page 4


Density of States Graph Kernels

An important problem on graph-structured data is that of quantifying sim...

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

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

Propagation Kernels

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

Graph Kernels: A Survey

Graph kernels have attracted a lot of attention during the last decade, ...

Faster Kernels for Graphs with Continuous Attributes via Hashing

While state-of-the-art kernels for graphs with discrete labels scale wel...

Distributed Algorithms for Fully Personalized PageRank on Large Graphs

Personalized PageRank (PPR) has enormous applications, such as link pred...

Geometric tree kernels: Classification of COPD from airway tree geometry

Methodological contributions: This paper introduces a family of kernels ...