arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.04566stat.MLcs.LG
收藏

压缩数据的分散聚类算法

Decentralized Clustering on Compressed Data without Prior Knowledge of the Number of Clusters

IMT Atlantique(IMT大西洋高等矿业电信学院);Univ. Bretagne Loire(布列塔尼卢瓦尔大学)

Elsa Dupraz, Dominique Pastor, François-Xavier Socheleau

摘要:

在传感器网络中,建立融合中心并不总是可行的。因此,需要完全分散的聚类算法。分散式聚类算法应尽量减少传感器之间交换的数据量,以减少传感器的能量消耗。在这方面,我们提出了一个集中式和一个分散式的聚类算法,压缩数据的工作没有事先知道的集群的数量。在标准的K-means聚类算法中,通过多次重复该算法来估计聚类数,这大大增加了交换的数据量,而我们的算法可以在一次运行中估计这个数字。所提出的聚类算法来自一个理论框架,建立在渐近条件下,集群质心是唯一的固定点的成本函数,我们介绍。该成本函数取决于我们选择作为Wald假设检验的p值的权重函数。该p值测量给定测量向量属于给定聚类的可扩展性。实验结果表明,我们的两种算法是有竞争力的聚类性能方面的K-means和DB-Scan,同时降低了至少$2$的传感器之间交换的数据量的一个因素。

英文摘要:

In sensor networks, it is not always practical to set up a fusion center. Therefore, there is need for fully decentralized clustering algorithms. Decentralized clustering algorithms should minimize the amount of data exchanged between sensors in order to reduce sensor energy consumption. In this respect, we propose one centralized and one decentralized clustering algorithm that work on compressed data without prior knowledge of the number of clusters. In the standard K-means clustering algorithm, the number of clusters is estimated by repeating the algorithm several times, which dramatically increases the amount of exchanged data, while our algorithm can estimate this number in one run. The proposed clustering algorithms derive from a theoretical framework establishing that, under asymptotic conditions, the cluster centroids are the only fixed-point of a cost function we introduce. This cost function depends on a weight function which we choose as the p-value of a Wald hypothesis test. This p-value measures the plausibility that a given measurement vector belongs to a given cluster. Experimental results show that our two algorithms are competitive in terms of clustering performance with respect to K-means and DB-Scan, while lowering by a factor at least $2$ the amount of data exchanged between sensors.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑