Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Verbeek, J. J.
Right arrow Articles by Kröse, B.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Verbeek, J. J.
Right arrow Articles by Kröse, B.
(Neural Computation. 2003;15:469-485.)
© 2003 The MIT Press


Letter

Efficient Greedy Learning of Gaussian Mixture Models

J. J. Verbeek

jverbeek{at}science.uva.nl, Informatics Institute, University of Amsterdam, 1098 SJ Amsterdam, The Netherlands

N. Vlassis

vlassis{at}science.uva.nl, Informatics Institute, University of Amsterdam, 1098 SJ Amsterdam, The Netherlands

B. Kröse

krose{at}science.uva.nl, Informatics Institute, University of Amsterdam, 1098 SJ Amsterdam, The Netherlands

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.




This article has been cited by other articles:


Home page
Neural Comput.Home page
Z. Chen, S. Becker, J. Bondy, I. C. Bruce, and S. Haykin
A Novel Model-Based Hearing Compensation Design Using a Gradient-Free Optimization Method
Neural Comput., December 1, 2005; 17(12): 2648 - 2671.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2003 by The MIT Press.