Accelerated spectral clustering using graph filtering of random signals - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Accelerated spectral clustering using graph filtering of random signals

Abstract

We build upon recent advances in graph signal processing to propose a faster spectral clustering algorithm. Indeed, classical spectral clustering is based on the computation of the first k eigenvectors of the similarity matrix' Laplacian, whose computation cost, even for sparse matrices, becomes prohibitive for large datasets. We show that we can estimate the spectral clustering distance matrix without computing these eigenvectors: by graph filtering random signals. Also, we take advantage of the stochasticity of these random vectors to estimate the number of clusters k. We compare our method to classical spectral clustering on synthetic data, and show that it reaches equal performance while being faster by a factor at least two for large datasets.
Fichier principal
Vignette du fichier
ICASSP_2016_lap (1).pdf (655.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01243682 , version 1 (15-12-2015)
hal-01243682 , version 2 (12-01-2016)

Identifiers

Cite

Nicolas Tremblay, Gilles Puy, Pierre Borgnat, Rémi Gribonval, Pierre Vandergheynst. Accelerated spectral clustering using graph filtering of random signals. 41st IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2016), Mar 2016, Shanghai, China. ⟨hal-01243682v2⟩
377 View
409 Download

Altmetric

Share

Gmail Facebook X LinkedIn More