Swinburne
Browse

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

Download (1.03 MB)
conference contribution
posted on 2024-07-11, 09:16 authored by Mitchell Yuwono, Steven W. Su, Bruce Moulton, Hung Nguyen
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.

History

Available versions

PDF (Published version)

Journal title

2012 IEEE Congress on Evolutionary Computation, (CEC 2012), Brisbane, Queensland, Australia, 10-15 June 2012

Conference name

2012 IEEE Congress on Evolutionary Computation, CEC 2012, Brisbane, Queensland, Australia, 10-15 June 2012

Publisher

IEEE

Copyright statement

Public domain: U.S. Government work not protected by U.S. copyright

Language

eng

Usage metrics

    Publications

    Categories

    No categories selected

    Keywords

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC