期刊文献+

一种带控制节点的最小生成树聚类方法 被引量:7

A MST Based Clustering Method with Controlling Vertexes
下载PDF
导出
摘要 综合考虑对象间相对距离和高等级对象对低等级对象的集聚效应这两种聚类影响因素 ,提出了一种带控制节点的最小生成树聚类方法 .该方法用聚类对象间距离为权构建一棵最小生成树 ,将树中高等级节点作为分割最小树时选取被打断边的控制因素 ,使本次分割而成的两子树都包含控制节点 ,且被打断的边是在此条件下的最长边 ,最终使每棵子树包含且仅包含一个控制节点 .检验自构建数据和地震数据的聚类结果证明 ,该方法在某些情况下能够较好地揭示数据分布的真实规律 . Taking into consideration the two clustering factors, the mutual distance between clustering objects and the centralizing effects of the higher level objects on the lower, a new clustering method based on minimum cost span tree with control vertexes is proposed. The MST is built based on the power of the clustering objects' mutual distance, and the selecting standard of the splitted edges is controlled by the higher level vertexes. Each splitted edge should be the longest edge under the condition that the two descendant trees must include at least one controlling vertex, and each descendant tree would include one and only one controlling vertex by the end of the algorithm. It has been verified by clustering the data built by ourselves and the earthquake data that this method, with simple input and little intervention, can discover better the true law of data distribution in some cases. To fulfill the needs of data mining, the selecting standard of the controlling vertexes, the 'inconsistent edges' and the efficiency of the algorithm should be improved.
出处 《中国图象图形学报(A辑)》 CSCD 北大核心 2002年第8期765-770,共6页 Journal of Image and Graphics
基金 中国科学院知识创新项目 (CX10 G-D0 0 -0 6 KZCX1-Y-0 2 )
关键词 聚类方法 控制节点 最小生成树 数据挖掘 地震数据 数据库 Clustering, Controlling vertex, Minimum cost spanning tree
  • 相关文献

参考文献2

二级参考文献4

  • 1Sun Chung,Proceedings ofIPPS’96,1996年,302页
  • 2Cheng Guoliang,The Design and Analyses of Parallel Algorithm,1994年,30页
  • 3Huang M D,Proceedings of the2 6 th Annual.IEEE Sym posium,Portland,1985年,232页
  • 4Tsin Y H,SIAMJ Computer,1984年,13卷,3期,580页

共引文献5

同被引文献81

引证文献7

二级引证文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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