Empirical Comparison of Fast Clustering Algorithms for Large Data Sets

  title={Empirical Comparison of Fast Clustering Algorithms for Large Data Sets},
  author={Chih-Ping Wei and Yen-Hsien Lee and Che-Ming Hsu},
Several fast algorithms for clustering very large data sets have been proposed in the literature. CLARA is a combination of a sampling procedure and the classical PAM algorithm, while CLARANS adopts a serial randomized search strategy to find the optimal set of medoids. GAC-R and GAC-RARw exploit genetic search heuristics for solving clustering problems. In this research, we conducted an empirical comparison of these four clustering algorithms over a wide range of data characteristics… CONTINUE READING
Highly Cited
This paper has 50 citations. REVIEW CITATIONS

12 Figures & Tables



Citations per Year

fewer than 50 Citations

Semantic Scholar estimates that this publication has 50 citations based on the available data.

See our FAQ for additional information.