Random Matrix-Improved Kernels For Large Dimensional Spectral Clustering

Hafiz Tiomoko Ali, Abla Kammoun, Romain Couillet

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


Leveraging on recent random matrix advances in the performance analysis of kernel methods for classification and clustering, this article proposes a new family of kernel functions theoretically largely outperforming standard kernels in the context of asymptotically large and numerous datasets. These kernels are designed to discriminate statistical means and covariances across data classes at a theoretically minimal rate (with respect to data size). Applied to spectral clustering, we demonstrate the validity of our theoretical findings both on synthetic and real-world datasets (here, the popular MNIST database as well as EEG recordings on epileptic patients).
Original languageEnglish (US)
Title of host publication2018 IEEE Statistical Signal Processing Workshop (SSP)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages5
ISBN (Print)9781538615713
StatePublished - Sep 7 2018


Dive into the research topics of 'Random Matrix-Improved Kernels For Large Dimensional Spectral Clustering'. Together they form a unique fingerprint.

Cite this