期刊文献+

利用CondEns算法实现聚类过程的改进

Implementing the Process of Clustering with CondEns Algorithm
下载PDF
导出
摘要 在已知数据挖掘、聚类、数据聚类、非冗余等相关概念和基本聚类算法背景下,给出了非冗余聚类的总体概念框架和过程.引出了基于条件集非冗余聚类的改进聚类算法——CondEns算法,阐述了利用CondEns算法实现数集聚类的过程.最后在实验的基础上比较CondEns算法和没改进域聚类算法中的一种:CCIB算法,随着正交性减弱研究非冗余数集聚类的鲁棒性,发现了算法CondEns表现得比CCIB更好. This paper presents a general concept framework and the process of non-redundant clustering under the background of knowing some concepts about data mining, clustering, data clustering, non-redundant and the fundamental clustering algorithm. The advanced clustering algorithm CondEns, which is based on the conditional ensembles non-redundant clustering, is elicited. Finally CondEns algorithm and one former domain clustering algorithm CCIB is compared by experiments. The results show that the robustness of non-redundant data ensemble clustering with the orthogonality assumption will be weakening, and the CondEns algorithm outperformed the CCIB algorithm.
出处 《江西理工大学学报》 CAS 2008年第1期34-37,共4页 Journal of Jiangxi University of Science and Technology
关键词 :非冗余聚类 簇集 算法 non-redundant clustering cluster ensembles algorithm
  • 相关文献

参考文献10

  • 1Gordon A. A Survey of Constrained Classification[J]. Computational Statistics and Data Analysis, 1996,21:17-29.
  • 2Chechik G,Tishby N. Extracting Relevant Structures with Side Information [J]. In Advances in Neural Information Processing Systems,2002,15: 857-864.
  • 3Gondek D, Hofmann T. Non-redundant Data Clustering[C]. In Proceedings of the Fourth IEEE International Conference on Data Mining, 2004:75-82.
  • 4巴斯蒂安.武森,高学东.数据仓库与数据挖掘[M].北京:冶金工业出版社,2003.
  • 5David Gondek, Thomas Hofmann. Non-Redundant clustering with Conditional Ensembles[C]. Chicago,Illinois,USA. KDD' 05, 8:21-24.
  • 6Minaei-Bidgoli B, Topchy A,Punch W F. Ensembles of Partitions via Data Resampling[C].In Proceedings of the International Conference on Information Technology, 2004, 2:188-192.
  • 7Strehl A,Ghosh J. Cluster Ensembles: A Knowledge Reuse Framework for Combining Partitionings [J]. Journal of Machine Learning Research,2002,3: 583-617.
  • 8Havrda J and Charv' at F. Quantification Method of Classification Processes[M].Concept of Structural a-entropy. 1967,3:30-35.
  • 9Mirkin B. Reinterpreting the Category Utility Function[J]. Machine Learning, 2001,45 (2):219-218.
  • 10Tishby N, Pereira F C, Bialek W. The Information Bottleneck Method [C]. In Proceedings of the 37th Annual Allerton Conference on Communication, Control and Computing,1999:368-377.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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