130 citations · 173 across the 11 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.LG2016
Compressive K-means
Nicolas Keriven, Nicolas Tremblay, Yann Traonmilin +1
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 compres…
cs.LG2016★ 8 cited
Sketching for Large-Scale Learning of Mixture Models
Nicolas Keriven, Anthony Bourrier, Rémi Gribonval +1
Learning parameters from voluminous data can be prohibitive in terms of memory and computational requirements. We propose a "compressive learning" framework where we estimate model…