A Novel Algorithm for Informative Meta Similarity Clusters Using Minimum Spanning Tree

Details A Novel Algorithm for Informative Meta Similarity Clusters Using Minimum Spanning Tree A Novel Algorithm for Informative Meta Similarity Clusters Using Minimum Spanning Tree

2010-05-06

arxiv.org/abs/1005.4585v1

Computer Science

Other Computer Science

IEEE Publication format, International Journal of Computer Science and Information Security, IJCSIS, Vol. 8 No. 1, April 2010,

Scientific paper

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 radius and diameter of k clusters are computed to find the tightness of k clusters. The variance of the k clusters are also computed to find the compactness of the clusters. The second algorithm is proposed to create a dendrogram using the k clusters as objects with guaranteed inter-cluster similarity. The algorithm is also finds central cluster from the k number of clusters. The first algorithm uses divisive approach, where as the second algorithm uses agglomerative approach. In this paper we used both the approaches to find Informative Meta similarity clusters.

Affiliated with

Also associated with

No associations

Rating

A Novel Algorithm for Informative Meta Similarity Clusters Using Minimum Spanning Tree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Novel Algorithm for Informative Meta Similarity Clusters Using Minimum Spanning Tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Novel Algorithm for Informative Meta Similarity Clusters Using Minimum Spanning Tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26856