期刊文献+

一种基于高斯混合模型的无监督粗糙聚类方法 被引量:8

An unsupervised rough clustering method based on gaussian mixture model
下载PDF
导出
摘要 针对数据统计分布的随机性和复杂性,从统计聚类的角度出发,采用高斯混合模型来描述整个数据的概率密度函数,提出了一种基于高斯混合模型的粗糙聚类分析方法.该方法首先利用粗糙集理论的不可区分关系性质以及生成的逻辑规则来设定EM算法的初始近似参数,然后通过Expectation-M axim ization(EM)算法估计各分量概率密度分布的最大似然参数集,最后通过密度分布概率大小来确定类别的归属.与传统的k-m eans聚类算法的试验结果比较表明,该方法是有效的,并且具有较高的聚类精度,用规则集来描述聚类的结果具有可解释性和合理性. Aiming at resolving randomness and complexity of data statistical distribution, the whole data probability density function is described by Gaussian mixture model in the sight of statistical clustering. A rough clustering analysis method based on Gaussian mixture model is proposed. Firstly, the initial parameters of EM obtained by indiscernibility relation and logic rules generated with rough set theory. Secondly, the maximum likelihood parameters of each component probability density distribution can be estimated by EM iterative computation. Finally, the classification is determined through density distribution probability value. Experimental results show that the new method is effective. Compared with conventional k -means clustering algorithm, it has higher clustering precision and the clustering resuhs described by the rule sets are interpretable and rational.
出处 《哈尔滨工业大学学报》 EI CAS CSCD 北大核心 2006年第2期256-259,322,共5页 Journal of Harbin Institute of Technology
基金 国家高技术研究发展计划资助项目(2003AA1Z2610)
关键词 高斯混合模型 粗糙集 EM算法 聚类 gaussian mixture model rough set EM algorithm clustering
  • 相关文献

参考文献15

  • 1JAIN A K, MURTY M N, FLYNN P J. Data clustering:Review [J]. ACM Computing Surveys (CSUR), 1999,31(3) : 264 -323.
  • 2HAN J W, KAMBER M. Data Mining: Concepts and Techniques[M]. San Francisco: Morgan Kaufmann, 2001.
  • 3ZHANG T, RAMAKRISHNAN R, LIVNY M. BIRCH:An efficient data clustering method for very large databases [A]. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data [C]. New York: ACM Press, 1996. 103- 114.
  • 4GUHA S, RASTOGI R, SHIM K. CURE: An efficient data. clustering method for very large databases [J].ACM SIGMOD Record, 1998, 27(2) : 73 -84.
  • 5KARYPIS G, HAN E H, KUMARL V. CHAMELEON:A hierarchical clustering algorithm using dynamic modeling[J]. Computer, 1999, 32 (8): 68-75.
  • 6ESTER M, KRIEGEL H P, SANDER J, et al. A density2based algorithm for discovering clusters in large spatial databases [A]. Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining(KDD'96) [C]. Portland, OR: AAAI Press, 1996.226 - 231.
  • 7ANKERST M, BREUNING M M, KRIEGEL H P, et al.OPTICS: Ordering points to identify the clustering structure [A]. Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data [C]. Philadelphia,Pennsylvania: ACM Press, 1999. 49-60.
  • 8AGRAWAL R, GEHRKE J, GUNOPULOS D, et al.Automatic subspace clustering of high dimensional data for data mining applications [A]. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data [C]. Data Seattle, Washington: ACM Press, 1998. 94 - 105.
  • 9PAWLAK Z. Rough sets and intelligent data analysis[J]. Information Science, 2002, 147(11):1 - 12.
  • 10LAURITZEN S L. The EM algorithm for graphical association models with missing data [J]. Computational Statistics and Data Analysis, 1995,19 : 191 - 201.

同被引文献97

引证文献8

二级引证文献52

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部