arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.03537math.STstat.TH
收藏

基于稳健估计和假设检验的分散聚类

Decentralized Clustering based on Robust Estimation and Hypothesis Testing

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

摘要:

本文考虑了一种没有融合中心的传感器网络,这种网络在涉及嵌入在自主无人机或机器人上的传感器的应用中可能很难建立。在这种情况下,本文认为,传感器必须在一个完全分散的设置执行给定的聚类任务。标准的聚类算法通常需要知道聚类的数量,并且对初始化非常敏感,这使得它们很难在完全分散的设置中使用。在这方面,本文提出了一种分散的基于模型的聚类算法,克服了这些问题。该算法是基于一个新的理论框架,依赖于假设检验和强大的M-估计。更具体地说,决定两个数据是否属于同一聚类的问题可以通过对高斯随机向量的均值进行Wald假设检验来最优地解决。该检验的p值使得可以定义一种新类型的评分函数,特别适合于设计质心的M估计。由此产生的分散式算法有效地执行聚类,而无需事先知道聚类的数量。它也被证明是不太敏感的初始化比已经存在的聚类算法,这使得它适合于在没有融合中心的传感器网络中使用。

英文摘要:

This paper considers a network of sensors without fusion center that may be difficult to set up in applications involving sensors embedded on autonomous drones or robots. In this context, this paper considers that the sensors must perform a given clustering task in a fully decentralized setup. Standard clustering algorithms usually need to know the number of clusters and are very sensitive to initialization, which makes them difficult to use in a fully decentralized setup. In this respect, this paper proposes a decentralized model-based clustering algorithm that overcomes these issues. The proposed algorithm is based on a novel theoretical framework that relies on hypothesis testing and robust M-estimation. More particularly, the problem of deciding whether two data belong to the same cluster can be optimally solved via Wald's hypothesis test on the mean of a Gaussian random vector. The p-value of this test makes it possible to define a new type of score function, particularly suitable for devising an M-estimation of the centroids. The resulting decentralized algorithm efficiently performs clustering without prior knowledge of the number of clusters. It also turns out to be less sensitive to initialization than the already existing clustering algorithms, which makes it appropriate for use in a network of sensors without fusion center.

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

↑