Reference : A greedy EM algorithm for Gaussian mixture learning
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/11066
A greedy EM algorithm for Gaussian mixture learning
English
Vlassis, Nikos mailto [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) > >]
Likas, A. [> >]
2002
Neural Processing Letters
Kluwer
15
1
77-87
Yes (verified by ORBilu)
1370-4621
[en] Learning a Gaussian mixture with a local algorithm like EM can be difficult because (i) the true number of mixing components is usually unknown, (ii) there is no generally accepted method for parameter initialization, and (iii) the algorithm can get trapped in one of the many local maxima of the likelihood function. In this paper we propose a greedy algorithm for learning a Gaussian mixture which tries to overcome these limitations. In particular, starting with a single component and adding components sequentially until a maximum number k, the algorithm is capable of achieving solutions superior to EM with k components in terms of the likelihood of a test set. The algorithm is based on recent theoretical results on incremental mixture density estimation, and uses a combination of global and local search each time a new component is added to the mixture.
http://hdl.handle.net/10993/11066

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
download.pdfPublisher postprint123.34 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.