Efficient greedy learning of Gaussian mixtures

Abstract : We present a deterministic greedy method to learn a mixture of Gaussians which runs in O(nk^2) time. The key element is that we build the mixture component-wise. By allocating a new component close to optimal in the existing (close to optimal) learned mixture, we hope to be able to reach a solution close to optimal for the new mixture. Each component of the mixture is characterized by a fixed number of parameters. Then, instead of solving directly a optimization problem involving the parameters of all components, we replace the problem by a sequence of optimization problems involving only the parameters of the new component. We include experimental results obtained on image segmentation and reconstruction tasks as well as results of extensive tests on artificially generated data sets. In these experiments the learning method compares favorably to the standard EM with random initializations as well as to another existing greedy approach to learning Gaussian mixtures.
Document type :
Reports
Complete list of metadatas


https://hal.inria.fr/inria-00321507
Contributor : Jakob Verbeek <>
Submitted on : Wednesday, February 16, 2011 - 5:07:17 PM
Last modification on : Monday, September 25, 2017 - 10:08:04 AM
Long-term archiving on : Tuesday, May 17, 2011 - 2:36:01 AM

Files

verbeek01tr2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00321507, version 1

Collections

Citation

Jakob Verbeek, Nikos Vlassis, Ben Krose. Efficient greedy learning of Gaussian mixtures. [Technical Report] IAS-UVA-01-10, 2001, pp.22. ⟨inria-00321507⟩

Share

Metrics

Record views

150

Files downloads

288