计算机工程与应用Issue(20)：111-115,5.DOI:10.3778/j.issn.1002-8331.1411-0267
一种快速、贪心的高斯混合模型EM算法研究
Rapid greedy EM algorithm research based on Gaussian mixture model
邢长征 1苑聪1
作者信息
- 1. 辽宁工程技术大学 电子与信息工程学院，辽宁 葫芦岛 125105
- 折叠
摘要
Abstract
In order to solve the disadvantages of traditional EM algorithm which initial model component parameters need to preassign and the convergence speed follows the growth of sample numbers, an rapid greedy EM algorithm for Gaussian mixture model is proposed. This algorithm adopts greedy strategy and uses appropriate implicit parameters to accelerate the speed of convergence, which can precisely get the optimal solution of the model component in a few itera-tions. In experiments, compared with traditional EM algorithm, unsupervised EM algorithm and robust EM algorithm, the algorithm is robust, in addition, it can improve the efficiency of algorithm and the accuracy of the model component parameters.关键词
贪心/高斯混合模型/隐含参量/最大期望(EM)算法Key words
greedy/Gaussian mixture model/implicit parameter/Expectation Maximization(EM)algorithm分类
信息技术与安全科学引用本文复制引用
邢长征,苑聪..一种快速、贪心的高斯混合模型EM算法研究[J].计算机工程与应用,2015,(20):111-115,5.
