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

by   Elsa Dupraz, et al.

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.


page 1

page 2

page 3

page 4


Performance evaluation results of evolutionary clustering algorithm star for clustering heterogeneous datasets

This article presents the data used to evaluate the performance of evolu...

A new clustering algorithm for prolonging the lifetime of wireless sensor networks

Energy efficient resource management is critical for prolonging the life...

Cloud-Cluster Architecture for Detection in Intermittently Connected Sensor Networks

We consider a centralized detection problem where sensors experience noi...

Integrating Prior Knowledge in Mixed Initiative Social Network Clustering

We propose a new paradigm—called PK-clustering—to help social scientists...

Decentralized Clustering and Linking by Networked Agents

We consider the problem of decentralized clustering and estimation over ...

Ant Colony Inspired Machine Learning Algorithm for Identifying and Emulating Virtual Sensors

The scale of systems employed in industrial environments demands a large...

Light Source Point Cluster Selection Based Atmosphere Light Estimation

Atmosphere light value is a highly critical parameter in defogging algor...

Please sign up or login with your details

Forgot password? Click here to reset