文章基本信息

标题：A Novel Algorithm for Meta Similarity Clusters Using Minimum Spanning Tree
作者：S.John Peter ; S.P.Victor
期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2010
卷号：10
期号：2
页码：254-259
出版社：International Journal of Computer Science and Network Security
摘要：The minimum spanning tree clustering algorithm is capable of detecting clusters with irregular boundaries. In this paper we propose two minimum spanning trees based clustering algorithm. The first algorithm produces k clusters with center and guaranteed intra-cluster similarity. The second algorithm is proposed to create a dendrogram using the k clusters as objects with guaranteed inter-cluster similarity. The first algorithm uses divisive approach, where as the second algorithm uses agglomerative approach. In this paper we used both the approaches to find Meta similarity clusters.
关键词：Euclidean minimum spanning tree; Subtree; Clustering; Eccentricity; Center; Hierarchical clustering; Dendrogram; Subtree