Average Sensitivity of Spectral Clustering

06/07/2020
by   Pan Peng, et al.
0

Spectral clustering is one of the most popular clustering methods for finding clusters in a graph, which has found many applications in data mining. However, the input graph in those applications may have many missing edges due to error in measurement, withholding for a privacy reason, or arbitrariness in data conversion. To make reliable and efficient decisions based on spectral clustering, we assess the stability of spectral clustering against edge perturbations in the input graph using the notion of average sensitivity, which is the expected size of the symmetric difference of the output clusters before and after we randomly remove edges. We first prove that the average sensitivity of spectral clustering is proportional to λ_2/λ_3^2, where λ_i is the i-th smallest eigenvalue of the (normalized) Laplacian. We also prove an analogous bound for k-way spectral clustering, which partitions the graph into k clusters. Then, we empirically confirm our theoretical bounds by conducting experiments on synthetic and real networks. Our results suggest that spectral clustering is stable against edge perturbations when there is a cluster structure in the input graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2017

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

Spectral clustering is amongst the most popular methods for community de...
research
08/18/2023

Eigenvalue-based Incremental Spectral Clustering

Our previous experiments demonstrated that subsets collections of (short...
research
10/25/2018

Spectral Embedding Norm: Looking Deep into the Spectrum of the Graph Laplacian

The extraction of clusters from a dataset which includes multiple cluste...
research
08/21/2017

Preconditioned Spectral Clustering for Stochastic Block Partition Streaming Graph Challenge

Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is demo...
research
09/13/2023

Robustness for Spectral Clustering of General Graphs under Local Differential Privacy

Spectral clustering is a widely used algorithm to find clusters in netwo...
research
03/02/2021

Network Cluster-Robust Inference

Since network data commonly consists of observations on a single large n...
research
06/07/2023

A low rank ODE for spectral clustering stability

Spectral clustering is a well-known technique which identifies k cluster...

Please sign up or login with your details

Forgot password? Click here to reset