A Dynamic Mode Decomposition Approach for Decentralized Spectral Clustering of Graphs

by   Hongyu Zhu, et al.
University of Surrey

We propose a novel robust decentralized graph clustering algorithm that is provably equivalent to the popular spectral clustering approach. Our proposed method uses the existing wave equation clustering algorithm that is based on propagating waves through the graph. However, instead of using a fast Fourier transform (FFT) computation at every node, our proposed approach exploits the Koopman operator framework. Specifically, we show that propagating waves in the graph followed by a local dynamic mode decomposition (DMD) computation at every node is capable of retrieving the eigenvalues and the local eigenvector components of the graph Laplacian, thereby providing local cluster assignments for all nodes. We demonstrate that the DMD computation is more robust than the existing FFT based approach and requires 20 times fewer steps of the wave equation to accurately recover the clustering information and reduces the relative error by orders of magnitude. We demonstrate the decentralized approach on a range of graph clustering problems.


page 1

page 2

page 3

page 4


Fast Approximate Spectral Clustering for Dynamic Networks

Spectral clustering is a widely studied problem, yet its complexity is p...

KCoreMotif: An Efficient Graph Clustering Algorithm for Large Networks by Exploiting k-core Decomposition and Motifs

Clustering analysis has been widely used in trust evaluation on various ...

Compressive Spectral Clustering

Spectral clustering has become a popular technique due to its high perfo...

A Modular Framework for Centrality and Clustering in Complex Networks

The structure of many complex networks includes edge directionality and ...

Iterative Spectral Method for Alternative Clustering

Given a dataset and an existing clustering as input, alternative cluster...

A New Spectral Clustering Algorithm

We present a new clustering algorithm that is based on searching for nat...

Simplifying Clustering with Graph Neural Networks

The objective functions used in spectral clustering are usually composed...

Please sign up or login with your details

Forgot password? Click here to reset