Tuesday 17 May 2011

Meta Similarity Noise-free Clusters Using Dynamic Minimum Spanning Tree with Self-Detection of Best Number of Clusters


AuthorT. Karthikeyan, S. John Peter
ISSN2079-8407
On Pages192-200
Volume No.2
Issue No.4
Issue DateApril 01, 2011
Publishing DateApril 01, 2011
KeywordsEuclidean minimum spanning tree, Subtree, Clustering, Eccentricity, Center, Hierarchical clustering, Dendrogram, Cluster validity, Cluster Separation, Outliers


Abstract

Clustering is a process of discovering group of objects such that the objects of the same group are similar, and objects belonging to different groups are dissimilar. A number of clustering algorithms exist that can solve the problem of clustering, but most of them are very sensitive to their input parameters. Minimum Spanning Tree clustering algorithm is capable of detecting clusters with irregular boundaries....

Download Link:

No comments:

Post a Comment