K-means algorithm is widely used in spatial clustering. It takes the mean value of each cluster centroid as the Heuristic information, so it has some disadvantages:  sensitive to the initial centroid and instability. The improved clustering algorithm referred to the best clustering centriod which is searched during the optimization of clustering centroid. That increased the searching probability around the best centroid and improved the stability of the algorithm. The experiment on two groups of representative dataset proved that the improved K-means algorithm performs better in global searching and is less sensitive to the initial centroid.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Improved K-Means Clustering Algorithm


    Contributors:
    Zhang, Zhe (author) / Zhang, Junxi (author) / Xue, Huifeng (author)


    Publication date :

    2008-05-01


    Size :

    330309 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English





    K-Harmonic Means Data Clustering with PSO Algorithm

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


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

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


    A Robust Fuzzy c-Means Clustering Algorithm for Incomplete Data

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