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 study of the latter unveils the mechanisms 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).
Liste complète des métadonnées

Cited literature [5 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01205208
Contributor : Florent Benaych-Georges <>
Submitted on : Friday, September 25, 2015 - 10:11:23 AM
Last modification on : Thursday, April 11, 2019 - 4:02:09 PM
Document(s) archivé(s) le : Tuesday, December 29, 2015 - 9:58:23 AM

File

spectral_clustering_camsap.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01205208, version 1

Collections

Citation

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

Share

Metrics

Record views

1077

Files downloads

152