Efficient greedy learning of Gaussian mixture models - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Neural Computation Année : 2003

Efficient greedy learning of Gaussian mixture models

Jakob Verbeek
Nikos Vlassis
  • Fonction : Auteur
  • PersonId : 853678

Résumé

This article concerns the greedy learning of gaussian mixtures. In the greedy approach, mixture components are inserted into the mixture one after the other. We propose a heuristic for searching for the optimal component to insert. In a randomized manner, a set of candidate new components is generated. For each of these candidates, we find the locally optimal new component and insert it into the existing mixture. The resulting algorithm resolves the sensitivity to initialization of state-of-the-art methods, like expectation maximization, and has running time linear in the number of data points and quadratic in the (final) number of mixture components. Due to its greedy nature, the algorithm can be particularly useful when the optimal number of mixture components is unknown. Experimental results comparing the proposed algorithm to other methods on density estimation and texture segmentation are provided.
Fichier principal
Vignette du fichier
verbeek03neco.pdf (597.25 Ko) Télécharger le fichier
Vignette du fichier
VVK03.png (14.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Format : Figure, Image
Loading...

Dates et versions

inria-00321487 , version 1 (16-02-2011)

Identifiants

Citer

Jakob Verbeek, Nikos Vlassis, Ben Krose. Efficient greedy learning of Gaussian mixture models. Neural Computation, 2003, 15 (2), pp.469-485. ⟨10.1162/089976603762553004⟩. ⟨inria-00321487⟩
222 Consultations
1393 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More