计算机与现代化 ›› 2011, Vol. 1 ›› Issue (8): 17-19,2.doi: 10.3969/j.issn.1006-2475.2011.08.005

• 人工智能 • 上一篇    下一篇

一种改进的基于MST的聚类算法

叶 青,唐鹏举   

  1. 怀化学院计算机系,湖南 怀化 418008
  • 收稿日期:2011-05-23 修回日期:1900-01-01 出版日期:2011-08-10 发布日期:2011-08-10

An Improved Clustering Method Based on MST

YE Qing, TANG Peng-ju

  

  1. Department of Computer Science, Huaihua College, Huaihua 418008, China
  • Received:2011-05-23 Revised:1900-01-01 Online:2011-08-10 Published:2011-08-10

摘要:

聚类是将数据分类到不同的类的一个过程,使同一个类中的对象有较大的相似性,不同类的个体有较大的差异性。本文提出一种改进的基于MST的聚类算法。该算法能更准确地确定不一致边,较好地符合人类视觉感知过程;聚类有效性表明该算法可提高聚类的效果;在信息分类与识别方面具有一定的应用价值。

关键词: 最小生成树, 不一致边, 聚类, 影响区域, 有效性

Abstract:

Clustering is the assignment of a set of observations into subsets so that observations in the same cluster are similar in some sense, observations in the different cluster are different. An improved clustering method based on MST is raised out. This method can determine discrepancy more exactly, which is more consistent with vision sensing process of human being. Evaluation of clustering shows that it can increase effectiveness of cluster. This method can be used in the classification and recognition of information.

Key words: minimum spanning tree, discrepancy, cluster, domain of influence, effectiveness

中图分类号: