Automatic Clustering Based on Cluster Nearest Neighbor Distance (CNND) Algorithm
This article describes a simple and fast algorithm that can automatically detect any number of well separated clusters, which may be of any shape e.g. convex and/or non-convex. This is in contrast to most of the existing clustering algorithms that assume a value for the number of clusters and/or a particular cluster structure. This algorithm is based on the principle that there is a definite threshold in the intra-cluster distances between nearest neighbors in the same cluster. Promising results on both real and artificial datasets have been included to show the effectiveness of the proposed technique.
KeywordsCluster nearest Neighbour Clustering Automatic Clustering Various shaped clusters
Unable to display preview. Download preview PDF.
- 6.Jain, A.K.: Data clustering: 50 years beyond K-means. Pattern Recognition Lett. (2009), doi:10.1016/j.patrec.2009.09.011Google Scholar
- 8.Ben-Hur, A., Guyon, I.: Detecting Stable Clusters Using Principal Component Analysis in Methods of Molecular Biology. Humana Press (2003)Google Scholar