The maximum-likelihood estimate of a mixture model is usually found by using the EM algorithm. However, the EM algorithm suffers from the local-optimum problem and therefore we cannot obtain the potential performance of mixture models in practice. In the case of mixture models, local maxima often in
✦ LIBER ✦
A novel split-and-merge algorithm for hierarchical clustering of Gaussian mixture models
✍ Scribed by Branislav Popović, Marko Janev, Darko Pekar, Nikša Jakovljević, Milan Gnjatović, Milan Sečujski, Vlado Delić
- Book ID
- 118795116
- Publisher
- Springer US
- Year
- 2012
- Tongue
- English
- Weight
- 641 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0924-669X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
EM algorithm with split and merge operat
✍
Naonori Ueda; Ryohei Nakano
📂
Article
📅
2000
🏛
John Wiley and Sons
🌐
English
⚖ 623 KB
EM algorithms for Gaussian mixtures with
✍
Zhihua Zhang; Chibiao Chen; Jian Sun; Kap Luk Chan
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 794 KB
In order to alleviate the problem of local convergence of the usual EM algorithm, a split-and-merge operation is introduced into the EM algorithm for Gaussian mixtures. The split-and-merge equations are ÿrst presented theoretically. These equations show that the merge operation is a well-posed probl
Reducing the number of local linear mode
✍
Ahmad Kalhor; Babak N. Araabi; Caro Lucas
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 712 KB
A particular Gaussian mixture model for
✍
Hichem Sahbi
📂
Article
📅
2007
🏛
Springer
🌐
English
⚖ 632 KB
Hierarchical Clustering Algorithm for La
✍
Senthilnath, J.; Omkar, S.N.; Mani, V.; Tejovanth, N.; Diwakar, P.G.; Shenoy B,
📂
Article
📅
2012
🏛
Institute of Electrical and Electronics Engineers
🌐
English
⚖ 1007 KB
Joint modeling of hierarchically cluster
✍
Aklilu Habteab Ghebretinsae; Christel Faes; Geert Molenberghs; Helena Geys; Bas-
📂
Article
📅
2012
🏛
John Wiley and Sons
🌐
English
⚖ 206 KB