Sciweavers

Share
PCI
2005
Springer

Gossip-Based Greedy Gaussian Mixture Learning

8 years 11 months ago
Gossip-Based Greedy Gaussian Mixture Learning
Abstract. It has been recently demonstrated that the classical EM algorithm for learning Gaussian mixture models can be successfully implemented in a decentralized manner by resorting to gossip-based randomized distributed protocols. In this paper we describe a gossip-based implementation of an alternative algorithm for learning Gaussian mixtures in which components are added to the mixture one after another. Our new Greedy Gossip-based Gaussian mixture learning algorithm uses gossip-based parallel search, starting from multiple initial guesses, for finding good components to add to the mixture in each component allocation step. It can be executed on massive networks of small computing devices, converging to a solution exponentially faster than its centralized version, while reaching the same quality of generated models.
Nikos A. Vlassis, Yiannis Sfakianakis, Wojtek Kowa
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where PCI
Authors Nikos A. Vlassis, Yiannis Sfakianakis, Wojtek Kowalczyk
Comments (0)
books