DeepAI AI Chat
Log In Sign Up

Adaptive Diffusions for Scalable Learning over Graphs

by   Dimitris Berberidis, et al.

Diffusion-based classifiers such as those relying on the Personalized PageRank and the Heat kernel, enjoy remarkable classification accuracy at modest computational requirements. Their performance however is affected by the extent to which the chosen diffusion captures a typically unknown label propagation mechanism, that can be specific to the underlying graph, and potentially different for each class. The present work introduces a disciplined, data-efficient approach to learning class-specific diffusion functions adapted to the underlying network topology. The novel learning approach leverages the notion of "landing probabilities" of class-specific random walks, which can be computed efficiently, thereby ensuring scalability to large graphs. This is supported by rigorous analysis of the properties of the model as well as the proposed algorithms. Furthermore, a robust version of the classifier facilitates learning even in noisy environments. Classification tests on real networks demonstrate that adapting the diffusion function to the given graph and observed labels, significantly improves the performance over fixed diffusions; reaching -- and many times surpassing -- the classification accuracy of computationally heavier state-of-the-art competing methods, that rely on node embeddings and deep neural networks.


page 1

page 2

page 3

page 4


Semi-supervised classification on graphs using explicit diffusion dynamics

Classification tasks based on feature vectors can be significantly impro...

Beltrami Flow and Neural Diffusion on Graphs

We propose a novel class of graph neural networks based on the discretis...

Fast Graph Generation via Spectral Diffusion

Generating graph-structured data is a challenging problem, which require...

Context-guided diffusion for label propagation on graphs

Existing approaches for diffusion on graphs, e.g., for label propagation...

Network Embedding Using Sparse Approximations of Random Walks

In this paper, we propose an efficient numerical implementation of Netwo...

N odeS ig: Random Walk Diffusion meets Hashing for Scalable Graph Embeddings

Learning node representations is a crucial task with a plethora of inter...

Graph Convolutional Networks Meet with High Dimensionality Reduction

Recently, Graph Convolutional Networks (GCNs) and their variants have be...