Cov-HGMEM: An Improved Hierarchical Clustering Algorithm
In this paper we present an improved method for hierarchical clustering of Gaussian mixture components derived from Hierarchical Gaussian Mixture Expectation Maximization (HGMEM) algorithm.As HGMEM performs,it is efficient in reducing a large mixture of Gaussians into a smaller mixture while still preserving the component structure of the original mode.Compared with HGMEM algorithm,it takes covariance into account in Expectation-Step without affecting the Maximization-Step,avoiding excessive expansion of some components,and we simply call it Cov-HGMEM.Image retrieval experiments indicate that our proposed algorithm outperforms previously suggested method.
Sanming Song Qunsheng Yang Yinwei Zhan
Faculty of Computer,Guangdong University of Technology 510006 Guangzhou,P.R.China
国际会议
4th Asia Information Retrieval Symposium(AIRS 2008)(第四届亚洲信息检索研讨会)
哈尔滨
英文
424-429
2008-01-16(万方平台首次上网日期,不代表论文的发表时间)