Estimating local optimums in EM algorithm over Gaussian mixture model
EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is not guaranteed to converge to the global optimum. Instead, it stops at some local optimums, which can be much worse than th...
Saved in:
Main Authors: | ZHANG, Zhenjie, DAI, Bing Tian, TUNG, Anthony K.H. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2008
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4166 https://ink.library.smu.edu.sg/context/sis_research/article/5169/viewcontent/196.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Estimating local optimums in EM algorithm over Gaussian mixture model
by: Zhang, Z., et al.
Published: (2013) -
On the lower bound of local optimums in k-means algorithms
by: ZHANG, Zhenjie, et al.
Published: (2006) -
Lamarckian memetic algorithms : local optimum and connectivity structure analysis
by: Le, Minh Nghia, et al.
Published: (2021) -
Image change detection using Gaussian mixture model and genetic algorithm
by: Celik, T.
Published: (2014) -
Adaptive collective routing using gaussian process dynamic congestion models
by: LIU, Siyuan, et al.
Published: (2013)