Data Clustering Using Variants of Rapid Centroid Estimation

Publisher:
IEEE
Publication Type:
Journal Article
Citation:
IEEE Transactions on Evolutionary Computation, 2014, 18 (3), pp. 366 - 377
Issue Date:
2014-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2014 Yuwono Su Moulton Nguyen.pdfPublished Version18.78 MB
Adobe PDF
Prior work suggests that Particle Swarm Clustering (PSC) can be a powerful tool for solving clustering problems. This paper reviews parts of the PSC algorithm, and shows how and why a new class of algorithm is proposed in an attempt to improve on the ef?ciency and repeatability of PSC. This new implementation is referred to as Rapid Centroid Estimation (RCE). RCE simpli?es the update rules of PSC, and greatly reduces computational complexity by enhancing the ef?ciency of the particle trajectories. On benchmark evaluations with an arti?cial dataset that has 80 dimensions and a volume of 5000, the RCE variants have iteration times of less than 0.1 seconds, which compares to iteration times of 2 seconds for PSC and modi?ed PSC (mPSC). On UC Irvine (UCI) machine learning benchmark datasets, the RCE variants are much faster than PSC and mPSC, and produce clusters with higher purity and greatly improved optimization speeds. For example, the RCE variants are more than 100 times faster than PSC and mPSC on the UCI breast cancer dataset. It can be concluded that the RCE variants are leaner and faster than PSC and mPSC, and that the new optimization strategies also improve clustering quality and repeatability.
Please use this identifier to cite or link to this item: