Understanding Big Data Spectral Clustering

Abstract : This article introduces an original approach to understand the behavior of standard kernel spectral clustering algorithms (such as the Ng–Jordan–Weiss method) for large dimensional datasets. Precisely, using advanced methods from the field of random matrix theory and assuming Gaussian data vectors, we show that the Laplacian of the kernel matrix can asymptotically be well approximated by an analytically tractable equivalent random matrix. The analysis of the former allows one to understand deeply the mechanism into play and in particular the impact of the choice of the kernel function and some theoretical limits of the method. Despite our Gaussian assumption, we also observe that the predicted theoretical behavior is a close match to that experienced on real datasets (taken from the MNIST database).
Document type :
Conference papers
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01242494
Contributor : Matha Deghel <>
Submitted on : Saturday, December 12, 2015 - 6:20:39 PM
Last modification on : Friday, September 20, 2019 - 4:34:03 PM
Long-term archiving on : Saturday, April 29, 2017 - 12:13:28 PM

File

camsap_spectralclustering.pdf
Explicit agreement for this submission

Identifiers

Citation

Romain Couillet, Florent Benaych-Georges. Understanding Big Data Spectral Clustering. IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP 2015) , Dec 2015, Cancun, Mexico. ⟨10.1109/camsap.2015.7383728 ⟩. ⟨hal-01242494⟩

Share

Metrics

Record views

800

Files downloads

168