location: Current position: Home >> Scientific Research >> Paper Publications

An improved incomplete AP clustering algorithm based on K nearest neighbours

Hits:

Indexed by:期刊论文

Date of Publication:2019-01-01

Journal:International Journal of Embedded Systems

Included Journals:EI

Volume:11

Issue:3

Page Number:269-277

ISSN No.:17411068

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. Copyright © 2019 Inderscience Enterprises Ltd.

Pre One:Robust and Graph Regularized Non-Negative Matrix Factorization for Heterogeneous Co-Transfer Clustering

Next One:Dependable deep computation model for feature learning on big data in cyber-physical systems