Method for increasing the computation speed of an unsupervised learning approach for data clustering

Publication Type:
Conference Proceeding
2012 IEEE Congress on Evolutionary Computation, CEC 2012, 2012
Issue Date:
Filename Description Size
Thumbnail2012004160OK.pdf1.23 MB
Adobe PDF
Full metadata record
Clustering can be especially effective where the data is irregular, noisy and/or not differentiable. A major obstacle for many clustering techniques is that they are computationally expensive, hence limited to smaller data volume and dimension. We propose a lightweight swarm clustering solution called Rapid Centroid Estimation (RCE). Based on our experiments, RCE has significantly quickened optimization time of its predecessors, Particle Swarm Clustering (PSC) and Modified Particle Swarm Clustering (mPSC). Our experimental results show that on benchmark datasets, RCE produces generally better clusters compared to PSC, mPSC, K-means and Fuzzy C-means. Compared with K-means and Fuzzy C-means which produces clusters with 62% and 55% purities on average respectively, thyroid dataset has successfully clustered on average 71% purity in 14.3 seconds. © 2012 IEEE.
Please use this identifier to cite or link to this item: