A Clustering Algorithm for Datasets with Different Densities

Cluster analysis is a hot topic of data mining, and numerous methods or algorithms have been researched. In this article, a new cluster algorithm, called DDD algorithm, based on the decomposition of Delaunay Diagrams is proposed. The DDD algorithm can get non-spherical clusters other than spherical ones, and it can get clusters of high quality even if with lots of noise data, and it can get clusters with different density. The simulation experiments illustrate the above points.