Title :
A Clustering Algorithm for Datasets with Different Densities
Author :
Yang, Xiaobing ; He, Lingmin ; Lu, Huijuan
Author_Institution :
Comput. Sci. Dept., China Jiliang Univ., Hangzhou, China
Abstract :
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.
Keywords :
data handling; data mining; mesh generation; pattern clustering; DDD algorithm; Delaunay diagrams; cluster analysis; clustering algorithm; data mining; datasets; noise data; nonspherical clusters; Algorithm design and analysis; Clustering algorithms; Clustering methods; Computational modeling; Computer science; Data mining; Electronic mail; Helium; Information analysis; Noise robustness; DDD algorithm; Delaunay Diagrams; cluster analysis; data mining;
Conference_Titel :
Computer Technology and Development, 2009. ICCTD '09. International Conference on
Conference_Location :
Kota Kinabalu
Print_ISBN :
978-0-7695-3892-1
DOI :
10.1109/ICCTD.2009.158
