%0 Journal Article
%T An Attribute Clustering Algorithm Based on Minimum Spanning Tree<br>一种基于最小张树的属性聚类算法
%A PENG Chun
%A |hua
%A CHENG Qian
%A |sheng
%A <br>彭春华
%A 程乾生
%J 系统工程理论与实践
%D 2001
%I 
%X Combining with the method of minimum spanning tree in Graph theory, we present two concepts of similarity and contact degree in this paper, and build a new attribute clustering algorithm based on them. We compare the approach with some other methods such as FCM and AKM, in several problems for analyzing it's effectiveness. It is obvious that the approach we introduced here makes up a loss of other methods and could pactically solve problems in a certain extent.
%K minimum spanning tree
%K attribute cluster
%K similarity
%K contact degree<br>最小张树
%K 属性聚类
%K 相似度
%K 接触度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=E6B6FF01047E80D8&yid=14E7EF987E4155E6&vid=659D3B06EBF534A7&iid=0B39A22176CE99FB&sid=340AC2BF8E7AB4FD&eid=339D79302DF62549&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=4&reference_num=12