inria-00321022
https://inria.hal.science/inria-00321022
https://inria.hal.science/inria-00321022v2/document
https://inria.hal.science/inria-00321022v2/file/Verbeek04dmkd_rev.pdf
doi:10.1007/s10618-005-0033-3
[UGA] HAL Grenoble Alpes
[IMAG] IMAG
[CNRS] CNRS - Centre national de la recherche scientifique
[INRIA] INRIA - Institut National de Recherche en Informatique et en Automatique
[UNIV-GRENOBLE1] Université Joseph Fourier - Grenoble I
[INPG] Institut polytechnique de Grenoble
[INRIA-RHA] INRIA Grenoble - Rhône-Alpes
[IRISA] Irisa
[INRIA_TEST] INRIA - Institut National de Recherche en Informatique et en Automatique
[TESTALAIN1] TESTALAIN1
[INRIA2] INRIA 2
[UR1-MATH-STIC] UR1 - publications Maths-STIC
[UR1-UFR-ISTIC] UFR ISTIC Informatique et électronique
[INRIA-RENGRE] INRIA-RENGRE
[INRIA-300009] Inria 300009
[UR1-MATH-NUM] Pôle Rennes 1 - Mathématiques - Numérique
Accelerated EM-based clustering of large data sets
Verbeek, Jakob
Nunnink, Jan
Vlassis, Nikos
[INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG]
ART
Gaussian mixtures
EM algorithm
Free energy
kd-trees
Large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms like k-means, we derive an accelerated variant of the EM algorithm for Gaussian mixtures that: (1) offers speedups that are at least linear in the number of data points, (2) ensures convergence by strictly increasing a lower bound on the data log-likelihood in each learning step, and (3) allows ample freedom in the design of other accelerated variants. We also derive a similar accelerated algorithm for greedy mixture learning, where very satisfactory results are obtained. The core idea is to define a lower bound on the data log-likelihood based on a grouping of data points. The bound is maximized by computing in turn (i) optimal assignments of groups of data points to the mixture components, and (ii) optimal re-estimation of the model parameters based on average sufficient statistics computed over groups of data points. The proposed method naturally generalizes to mixtures of other members of the exponential family. Experimental results show the potential of the proposed method over other state-of-the-art acceleration techniques.
2006
2011-04-11
en
Data Mining and Knowledge Discovery
Springer