Skip to Main content Skip to Navigation
Journal articles

Sketched Clustering via Hybrid Approximate Message Passing

Abstract : 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.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download

https://hal.inria.fr/hal-01991231
Contributor : Antoine Chatalic <>
Submitted on : Friday, July 5, 2019 - 9:53:46 AM
Last modification on : Saturday, July 11, 2020 - 3:18:23 AM

File

sc.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

677

Files downloads

1702