Compressive K-means - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Compressive K-means

Abstract

The Lloyd-Max algorithm is a classical approach to perform K-means clustering. Unfortunately, its cost becomes prohibitive as the training dataset grows large. We propose a compressive version of K-means (CKM), that estimates cluster centers from a sketch, i.e. from a drastically compressed representation of the training dataset. We demonstrate empirically that CKM performs similarly to Lloyd-Max, for a sketch size proportional to the number of cen-troids times the ambient dimension, and independent of the size of the original dataset. Given the sketch, the computational complexity of CKM is also independent of the size of the dataset. Unlike Lloyd-Max which requires several replicates, we further demonstrate that CKM is almost insensitive to initialization. For a large dataset of 10^7 data points, we show that CKM can run two orders of magnitude faster than five replicates of Lloyd-Max, with similar clustering performance on artificial data. Finally, CKM achieves lower classification errors on handwritten digits classification.
Fichier principal
Vignette du fichier
paper.pdf (319.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01386077 , version 1 (26-10-2016)
hal-01386077 , version 2 (29-11-2016)
hal-01386077 , version 3 (09-01-2017)
hal-01386077 , version 4 (10-02-2017)

Identifiers

Cite

Nicolas Keriven, Nicolas Tremblay, Yann Traonmilin, Rémi Gribonval. Compressive K-means. ICASSP 2017 - IEEE International Conference on Acoustics, Speech and Signal Processing, Mar 2017, New Orleans, United States. ⟨hal-01386077v4⟩
998 View
746 Download

Altmetric

Share

Gmail Facebook X LinkedIn More