A Tighter Analysis of Spectral Clustering, and Beyond

08/02/2022
by   Peter Macgregor, et al.
5

This work studies the classical spectral clustering algorithm which embeds the vertices of some graph G=(V_G, E_G) into ℝ^k using k eigenvectors of some matrix of G, and applies k-means to partition V_G into k clusters. Our first result is a tighter analysis on the performance of spectral clustering, and explains why it works under some much weaker condition than the ones studied in the literature. For the second result, we show that, by applying fewer than k eigenvectors to construct the embedding, spectral clustering is able to produce better output for many practical instances; this result is the first of its kind in spectral clustering. Besides its conceptual and theoretical significance, the practical impact of our work is demonstrated by the empirical analysis on both synthetic and real-world datasets, in which spectral clustering produces comparable or better results with fewer than k eigenvectors.

READ FULL TEXT

page 2

page 30

page 31

research
09/12/2023

Spectral clustering algorithm for the allometric extension model

The spectral clustering algorithm is often used as a binary clustering m...
research
03/15/2016

Data Clustering and Graph Partitioning via Simulated Mixing

Spectral clustering approaches have led to well-accepted algorithms for ...
research
12/06/2019

Improved Analysis of Spectral Algorithm for Clustering

Spectral algorithms are graph partitioning algorithms that partition a n...
research
08/21/2020

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 ...
research
11/27/2019

Lifelong Spectral Clustering

In the past decades, spectral clustering (SC) has become one of the most...
research
03/05/2020

Auto-Tuning Spectral Clustering for Speaker Diarization Using Normalized Maximum Eigengap

In this study, we propose a new spectral clustering framework that can a...
research
07/04/2012

Unsupervised spectral learning

In spectral clustering and spectral image segmentation, the data is part...

Please sign up or login with your details

Forgot password? Click here to reset