Distributed Consensus-Based K-Means Algorithm in Switching Multi-Agent Networks  

作　　者：LIN Peng WANG Yinghui QI Hongsheng HONG Yiguang 

机构地区：[1]Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China [2]School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100190, China.

出　　处：《Journal of Systems Science & Complexity》2018年第5期1128-1145,共18页系统科学与复杂性学报（英文版）

基　　金：supported by the National Key Research and Development Program of China under Grant No.2016YFB0901902;the National Natural Science Foundation of China under Grant Nos.61573344,61333001,61733018,and 61374168

摘　　要：This paper discusses a distributed design for clustering based on the K-means algorithm in a switching multi-agent network, for the case when data are decentralized stored and unavailable to all agents. The authors propose a consensus-based algorithm in distributed case, that is, the double- clock consensus-based K-means algorithm （DCKA）. With mild connectivity conditions, the authors show convergence of DCKA to guarantee a distributed solution to the clustering problem, even though the network topology is time-varying. Moreover, the authors provide experimental results on vari- ous clustering datasets to illustrate the effectiveness of the fully distributed algorithm DCKA, whose performance may be better than that of the centralized K-means algorithm.

关 键 词：Consensus-based algorithm distributed K-means clustering multi-agent network switching topology. 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] TP311.13[自动化与计算机技术—控制科学与工程]