基于Vague图的最优树聚类  

Optimal tree clustering based on Vague diagram

作　　者：刘鑫琳 梁家荣[2] 

机构地区：[1]广西大学数学与信息科学学院,南宁530004 [2]广西大学计算机与电子信息学院,南宁530004

出　　处：《计算机工程与应用》2016年第3期123-126,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61363002)

摘　　要：在智能系统的开发和研究中,聚类分析是一个很重要的问题。为了减少传统的基于等价关系的聚类分析方法所造成的数据"失真"程度,提出了Vague图的最优树聚类方法,该方法引入了Vague树的概念,并通过计算最小二分割设计出Vague最优树,将该方法与基于等价关系的聚类分析方法和直接聚类法进行比较分析,结果表明该方法不仅仅有效地减少了"噪声",还具有连续性和全面性的特点,其聚类水平也更加合理。Clustering analysis is a very important problem in the research and development of intelligence system. In order to mitigate the data ＂distortion＂ degree caused by the traditional clustering analysis based on equivalence relations, the optimal tree Vague graph clustering method is proposed which introduces the concept of Vague trees and designs the Vague optimum tree by caculating the minimum of two segmentation. Compared with clustering analysis based on equivalence relations and directive clustering method, the result shows that the method not only effectively reduces the ＂noise＂, but also has the characteristics of continuity and comprehensiveness and more reasonable level of clustering.

关 键 词：VAGUE关系 最小二分割 最优树 聚类分析 

分 类 号：TP39[自动化与计算机技术—计算机应用技术]