An algorithm for scalable clustering: Ensemble Rapid Centroid Estimation

Publication Type:
Conference Proceeding
Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014, 2014, pp. 1250 - 1257
Issue Date:
Filename Description Size
ThumbnailYuwono Su Moulton Guo Nguyen 2014.pdf Published version985.07 kB
Adobe PDF
Full metadata record
© 2014 IEEE. This paper describes a new algorithm, called Ensemble Rapid Centroid Estimation (ERCE), designed to handle large-scale non-convex cluster optimization tasks, and estimate the number of clusters with quasi-linear complexity. ERCE stems from a recently developed Rapid Centroid Estimation (RCE) algorithm. RCE was originally developed as a lightweight simplification of the Particle Swarm Clustering (PSC) algorithm. RCE retained the quality of PSC, greatly reduced the computational complexity, and increased the stability. However, RCE has certain limitations with respect to complexity, and is unsuitable for non-convex clusters. The new ERCE algorithm presented here addresses these limitations.
Please use this identifier to cite or link to this item: