To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
A Novel Algorithm for Meta Similarity Clusters Using Minimum Spanning Tree |
|
Author |
S.John Peter, S.P.Victor |
| Citation |
Vol. 10 No. 2 pp. 254-259 |
|
Abstract |
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. |
|
Keywords |
Euclidean minimum spanning tree, Subtree, Clustering, Eccentricity, Center, Hierarchical clustering, Dendrogram, Subtree |
|
URL |
