Performance of iterative clustering algorithms depends highly on the choice of  cluster centers in each step. In this paper we propose an effective algorithm to compute new cluster centers for each iterative step for K-means clustering. This algorithm is based on the optimization formulation of the problem and a novel iterative method. The cluster centers computed using this methodology are found to be very close to the desired cluster centers, for iterative clustering algorithms. The experimental results using the proposed algorithm with a group of randomly constructed data sets are very promising.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Modified K-Means Clustering Algorithm


    Beteiligte:
    Li, Wei (Autor:in)


    Erscheinungsdatum :

    2008-05-01


    Format / Umfang :

    198997 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Improved K-Means Clustering Algorithm

    Zhang, Zhe / Zhang, Junxi / Xue, Huifeng | IEEE | 2008


    K-Harmonic Means Data Clustering with PSO Algorithm

    Nie, Fangyan / Tu, Tianyi / Pan, Meisen et al. | Springer Verlag | 2012


    A Robust Fuzzy c-Means Clustering Algorithm for Incomplete Data

    Li, Jinhua / Song, Shiji / Zhang, Yuli et al. | Springer Verlag | 2017


    Kernel K-means Clustering Algorithm Based on Parzen-window Estimation

    Liang, QIN / Wenguang, ZHANG / Zhen, WANG et al. | IEEE | 2018


    A Fast K-Means Clustering Algorithm Based on Grid Data Reduction

    Li, Daqi / Shen, Junyi / Chen, Hongmin | IEEE | 2008