| Autor: |
Jun Zhang, Ji-Huan He, Yuxi Fu, Xiaobing Yang, Fansheng Kong, Bihong Liu |
| Zdroj: |
Computational & Information Science; 2004, p1014-1019, 6p |
| Abstrakt: |
Gaussian mixture density decomposition (GMDD) algorithm is an approach to the modeling and decomposition of Gaussian mixtures, and it performs well with the least prior knowledge in most case. However, there are still some special cases in which the GMDD algorithm is difficult to converge or can not gain a valid Gaussian component. In this article, a k-means method for Gaussian mixture density modeling and decomposition is studied. Then based on the GMDD algorithm andk-means method, a new algorithm, called k-GMDD algorithm is proposed. It solves the problems of GMDD caused by the symmetry excellent, and consequently makes the applications of GMDD algorithm more extensive. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
