CRYSTAL - A new density-based fast and efficient clustering algorithm
暂无分享,去创建一个
[1] Ying Xu,et al. Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees , 2002, Bioinform..
[2] Atsuyuki Okabe,et al. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.
[3] Nicolai Petkov,et al. Algorithm That Mimics Human Perceptual Grouping of Dot Patterns , 2005, BVAI.
[4] Vipin Kumar,et al. Chameleon: Hierarchical Clustering Using Dynamic Modeling , 1999, Computer.
[5] Nikola Kasabov,et al. Efficient global clustering using the Greedy Elimination Method , 2004 .
[6] Ickjai Lee,et al. AUTOCLUST: Automatic Clustering via Boundary Extraction for Mining Massive Point-Data Sets , 2000 .
[7] Y Xu,et al. Minimum spanning trees for gene expression data clustering. , 2001, Genome informatics. International Conference on Genome Informatics.
[8] Craig Eldershaw,et al. Cluster Analysis using Triangulation , 1997 .
[9] George Karypis,et al. C HAMELEON : A Hierarchical Clustering Algorithm Using Dynamic Modeling , 1999 .
[10] Nikos A. Vlassis,et al. The global k-means clustering algorithm , 2003, Pattern Recognit..
[11] C. Gold,et al. Delete and insert operations in Voronoi/Delaunay methods and applications , 2003 .
[12] Chi-Hoon Lee,et al. On Data Clustering Analysis: Scalability, Constraints, and Validation , 2002, PAKDD.