Abstract
With the fast development of internet of things (IoT), a large amount of missing data is produced in the process of data collection and transmission. We call these data incomplete data. Many traditional methods use imputation or discarding strategy to cluster incomplete data. In this paper, we propose an improved incomplete affinity propagation (AP) clustering algorithm based on K nearest neighbours (IAPKNN). IAPKNN firstly partitions the dataset into complete and incomplete dataset, and then clusters the complete data set by AP clustering directly. Secondly, according to the similarity, IAPKNN extends the responsibility and availability matrices to the incomplete dataset. Finally, clustering algorithm is restarted based on the extended matrices. In addition, to address the clustering efficiency of large scale dataset, we give a distributed clustering algorithm scheme. Experiment results demonstrate that IAPKNN is effective in clustering incomplete data directly.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
