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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Modified K-Means Clustering Algorithm


    Contributors:
    Li, Wei (author)


    Publication date :

    2008-05-01


    Size :

    198997 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Modified Global K'-means Algorithm and Its Application to Data Clustering

    Li, D. / Qian, L. / Jin, Q. et al. | British Library Online Contents | 2011


    Improved K-Means Clustering Algorithm

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


    Artificial Immune C-Means Clustering Algorithm

    Lei, Z. / Renhou, L. | British Library Online Contents | 2005


    Bezdek type fuzzy attribute C-means clustering algorithm

    Jingwei, L. / Meizhi, X. | British Library Online Contents | 2007


    K-Harmonic Means Data Clustering with PSO Algorithm

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