Abstract Incomplete data are often encountered in data sets for clustering problems, and inappropriate treatment of incomplete data will significantly degrade the clustering performances. The Affinity Propagation (AP) algorithm is an effective algorithm for clustering analysis, but it is not directly applicable to the case of incomplete data. In view of the prevalence of missing data and the uncertainty of missing attributes, we put forward improved AP clustering for solving incomplete data problems. Three strategies(WDS, PDS and IPDS) are given, which involve modified versions of the AP algorithm. Clustering performances at different missing rates are discussed, and all approaches are tested on several UCI data sets with randomly missing data.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Affinity Propagation Clustering with Incomplete Data


    Beteiligte:
    Lu, Cheng (Autor:in) / Song, Shiji (Autor:in) / Wu, Cheng (Autor:in)


    Erscheinungsdatum :

    2014-01-01


    Format / Umfang :

    10 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Affinity Propagation Clustering with Incomplete Data

    Lu, C. / Song, S. / Wu, C. | British Library Conference Proceedings | 2014


    Affinity propagation clustering algorithm based on large-scale data-set

    Wang, Limin / Zheng, Kaiyue / Tao, Xing et al. | British Library Online Contents | 2018


    Radio Remote Head Clustering with Affinity Propagation Algorithm in C-RAN

    Park, Seju / Jo, Han-Shin / Mun, Cheol et al. | IEEE | 2019



    Dynamic RRH Clustering using Affinity Propagation Algorithm in Ultra-Dense C-RAN

    Park, Seju / Jo, Han-Shin / Mun, Cheol et al. | IEEE | 2020