| Author | T. Karthikeyan, S. John Peter |
| ISSN | 2079-8407 |
| On Pages | 192-200 |
| Volume No. | 2 |
| Issue No. | 4 |
| Issue Date | April 01, 2011 |
| Publishing Date | April 01, 2011 |
| Keywords | Euclidean 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