期刊文献+

一种改进的层次聚类算法 被引量:4

An Improved Algorithm of Hierarchical Clustering
下载PDF
导出
摘要 为了更好地实现聚类,在分析层次聚类(agglomerative)算法和神经网络的ART2算法的基础上,提出了一种改进的层次聚类算法.改进算法将首先采用一种基于ART2的改进神经网络聚类算法得到一个初始的聚类结果,然后在此基础上利用agglomerative算法实现分层聚类.实验结果表明,改进算法较原先传统的聚类算法,不但算法执行速度快、效率高,而且聚类效果也比较好. In order to achieve clustering well,a modified hierarchical clustering algorithm is proposed based on the strengths and weaknesses of hierarchical clustering(agglomerative) algorithm and neural network ART2 algorithm.Improved algorithm will first use an improved ART2 clustering algorithm to form initial clustering results,and then achieve hierarchical clustering result by agglomerative clustering algorithm based on the results of the previous.It is proved that the proposed algorithm is not only faster than the traditional clustering algorithm,but also the clustering result is better.
出处 《微电子学与计算机》 CSCD 北大核心 2010年第12期55-56,61,共3页 Microelectronics & Computer
基金 国家自然科学基金项目(60673087) 甘肃省自然科学基金项目(3ZS051-A25-047)
关键词 层次聚类 神经网络 ART2 hierarchical clustering neural network ART2
  • 相关文献

参考文献5

二级参考文献25

  • 1刘向东,包春江.K-均值聚类法在机械设备铁谱监测技术中的应用[J].机械设计与制造,2006(5):86-87. 被引量:3
  • 2齐继阳,竺长安.设备故障智能诊断方法的研究[J].仪器仪表学报,2006,27(10):1270-1275. 被引量:15
  • 3郎显宇,陆忠华,迟学斌.一种基于“基因表达谱”的并行聚类算法[J].计算机学报,2007,30(2):311-316. 被引量:11
  • 4KANTARDZIC M. Data mining concepts, models,methods and algorithms[M].北京:清华大学出版社,2003.
  • 5CARPENTER G, GROSSBERG S. ART 2: Self-organization of stable category recognition codes for analog input pattems[C]//Proceedings of the IEEE First In- ternational Conference on Neural Networks, 1987: 727- 735.
  • 6ALAHAKOON D, HALGAMUGE S K. Dynamic selforganizing maps with controlled growth for knowledge discovery[J]. Neural Networks, 2000 ( 11 ) : 601-614.
  • 7YOUNGTAE P. An ART2 trained by two-stage learning on circularly ordered data sequence[J]. Neural Networks, 1994(5) : 2928-2933.
  • 8Leonid Portnoy, Eleazar Eskin and Salvatore J Stolfo.Intrusiondetection with Unlabeled Data Using Clustering.Proceedings of ACM CSS Workshop on Data Mining Applied to Security (DMSA-2001). Philadelphia, PA:November2001, 5~8,
  • 9KDD99. KDD99 Cup Dataset. http: / / kdd. ics. uci.edu/databases/kddcup99/kddcup99.html. 1999.
  • 10MehmedKantardzic著 闪四清译.数据挖掘—概念、模型、方法和算法[M].清华大学出版社,2003..

共引文献21

同被引文献28

  • 1杨善林,李永森,胡笑旋,潘若愚.K-MEANS算法中的K值优化问题研究[J].系统工程理论与实践,2006,26(2):97-101. 被引量:188
  • 2Dunham,M.H.数据挖掘教程[M].邓崇慧,等译.北京:清华大学出版社,2004.
  • 3周芳芳,樊晓平,叶榛.均值漂移算法的研究与应用[J].控制与决策,2007,22(8):841-847. 被引量:59
  • 4Kantardzic M. Data mining concepts, models, methods and algorithms[M]. 北京:清华大学出版社,2003.
  • 5Beyer K S, Goldstein J, Ramakrishnan R, et al. When is 'nearest neighbor' meaningful? [C]//Proceedings of the 7th International Conference On Data Theory. Lodon, UK:Springer-Verlay, 1999:217-235.
  • 6Fisher A. Iris plants database[EB/OL]. [2011-04-16]. http://archive.ics. uci. edu/rnl/datasets/Iris. Html. Authorized license.
  • 7Jeh G, Widom J. SimRank.. a measure of structural- context similarity[C] ff Proc 2002 ACM SIGKDD Int Conf on Knowledge Discovery and DataMining, Edmonton,Canada: ACM, 2002 : 538-543.
  • 8Shi J, Malik J. Normalized cuts and image segmenta tion[J]. IEEE Trans attern Analysis and Machine Intelligence, 2000 : 888-905.
  • 9Pons P, Latapy M. Computing communities in large networks using random walks[J]. Journal of Graph Algorithms and Applications, 10(2):191-218,2006.
  • 10Sambasivam S,Theodosopoulos N.Advanced Data Clustering Methods of Mining Web Documents[J].Issues in Informing Science and Information Technology,2006,8(3):563-579.

引证文献4

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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