Sketched Clustering via Hybrid Approximate Message Passing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE Transactions on Signal Processing Year : 2019

Sketched Clustering via Hybrid Approximate Message Passing


In sketched clustering, a dataset of T samples is first sketched down to a vector of modest size, from which the centroids are subsequently extracted. Its advantages include 1) reduced storage complexity and 2) centroid extraction complexity independent of T. For the sketching methodology recently proposed by Keriven et al., which can be interpreted as a random sampling of the empirical characteristic function, we propose a sketched clustering algorithm based on approximate message passing. Numerical experiments suggest that our approach is more efficient than the state-of-the-art sketched clustering algorithm “CL-OMPR” (in both computational and sample complexity) and more efficient than k-means++ when T is large.
Fichier principal
Vignette du fichier
sc.pdf (387.09 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01991231 , version 1 (23-01-2019)
hal-01991231 , version 2 (05-07-2019)



Evan Byrne, Antoine Chatalic, Rémi Gribonval, Philip Schniter. Sketched Clustering via Hybrid Approximate Message Passing. IEEE Transactions on Signal Processing, 2019, 67 (17), pp.4556-4569. ⟨10.1109/TSP.2019.2924585⟩. ⟨hal-01991231v2⟩
246 View
181 Download



Gmail Mastodon Facebook X LinkedIn More