![]() |
个人信息Personal Information
教授
博士生导师
硕士生导师
主要任职:teaching
性别:男
毕业院校:重庆大学
学位:博士
所在单位:软件学院、国际信息与软件学院
学科:软件工程. 计算机软件与理论
办公地点:开发区综合楼405
联系方式:Email: zkchen@dlut.edu.cn Moble:13478461921 微信:13478461921 QQ:1062258606
电子邮箱:zkchen@dlut.edu.cn
An improved incomplete AP clustering algorithm based on K nearest neighbours
点击次数:
论文类型:期刊论文
发表时间:2019-01-01
发表刊物:International Journal of Embedded Systems
收录刊物:EI
卷号:11
期号:3
页面范围:269-277
ISSN号:17411068
摘要: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.