Clustering for directed graphs using parametrized random walk diffusion kernels

10/01/2022
by   Harry Sevi, et al.
0

Clustering based on the random walk operator has been proven effective for undirected graphs, but its generalization to directed graphs (digraphs) is much more challenging. Although the random walk operator is well-defined for digraphs, in most cases such graphs are not strongly connected, and hence the associated random walks are not irreducible, which is a crucial property for clustering that exists naturally in the undirected setting. To remedy this, the usual workaround is to either naively symmetrize the adjacency matrix or to replace the natural random walk operator by the teleporting random walk operator, but this can lead to the loss of valuable information carried by edge directionality. In this paper, we introduce a new clustering framework, the Parametrized Random Walk Diffusion Kernel Clustering (P-RWDKC), which is suitable for handling both directed and undirected graphs. Our framework is based on the diffusion geometry and the generalized spectral clustering framework. Accordingly, we propose an algorithm that automatically reveals the cluster structure at a given scale, by considering the random walk dynamics associated with a parametrized kernel operator, and by estimating its critical diffusion time. Experiments on K-NN graphs constructed from real-world datasets and real-world graphs show that our clustering approach performs well in all tested cases, and outperforms existing approaches in most of them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/07/2022

Generalized Spectral Clustering for Directed and Undirected Graphs

Spectral clustering is a popular approach for clustering undirected grap...
research
11/28/2018

Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets

We introduce a novel harmonic analysis for functions defined on the vert...
research
12/20/2022

Strong uniform convergence of Laplacians of random geometric and directed kNN graphs on compact manifolds

Consider n points independently sampled from a density p of class 𝒞^2 on...
research
02/19/2014

Transduction on Directed Graphs via Absorbing Random Walks

In this paper we consider the problem of graph-based transductive classi...
research
05/22/2017

Online Factorization and Partition of Complex Networks From Random Walks

Finding the reduced-dimensional structure is critical to understanding c...
research
11/02/2022

Time-aware Random Walk Diffusion to Improve Dynamic Graph Learning

How can we augment a dynamic graph for improving the performance of dyna...
research
12/06/2017

Oblivious Routing via Random Walks

We present novel oblivious routing algorithms for both splittable and un...

Please sign up or login with your details

Forgot password? Click here to reset