Spectral Clustering via Graph Filtering: Consistency on the High-Dimensional Stochastic Block Model

02/12/2017
by   Muni Sreenivas Pydi, et al.
0

Spectral clustering is amongst the most popular methods for community detection in graphs. A key step in spectral clustering algorithms is the eigen-decomposition of the n×n graph Laplacian matrix to extract its k leading eigenvectors, where k is the desired number of clusters among n objects. This is prohibitively complex to implement for very large datasets. However, it has recently been shown that it is possible to bypass the eigen-decomposition by computing an approximate spectral embedding through graph filtering of random signals. In this paper, we prove that spectral clustering performed via graph filtering can still recover the planted clusters consistently, under mild conditions. We analyse the effects of sparsity, dimensionality and filter approximation error on the consistency of the algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/21/2020

Strong Consistency, Graph Laplacians, and the Stochastic Block Model

Spectral clustering has become one of the most popular algorithms in dat...
research
06/12/2017

Fast Approximate Spectral Clustering for Dynamic Networks

Spectral clustering is a widely studied problem, yet its complexity is p...
research
02/05/2016

Compressive Spectral Clustering

Spectral clustering has become a popular technique due to its high perfo...
research
08/01/2023

Explainable Graph Spectral Clustering of Text Documents

Spectral clustering methods are known for their ability to represent clu...
research
11/14/2012

Spectral Clustering: An empirical study of Approximation Algorithms and its Application to the Attrition Problem

Clustering is the problem of separating a set of objects into groups (ca...
research
06/07/2020

Average Sensitivity of Spectral Clustering

Spectral clustering is one of the most popular clustering methods for fi...
research
12/17/2017

Path-Based Spectral Clustering: Guarantees, Robustness to Outliers, and Fast Algorithms

We consider the problem of clustering with the longest leg path distance...

Please sign up or login with your details

Forgot password? Click here to reset