An efficient decentralized clustering algorithm for aggregation of noisy multi-mean data

We describe VarClust , a gossip-based decentralized clustering algorithm designed to support multi-mean decentralized aggregation in energy-constrained wireless sensor networks. We empirically demonstrate that VarClust is at least as accurate as, and requires less node-to-node communication (and hen...

Full description

Saved in:
Bibliographic Details
Published in:Journal of heuristics Vol. 21; no. 2; pp. 301 - 328
Main Authors: Buadhacháin, Séamus Ó, Provan, Gregory
Format: Journal Article
Language:English
Published: Boston Springer US 01.04.2015
Springer Nature B.V
Subjects:
Algorithms
Analysis
Artificial Intelligence
Calculus of Variations and Optimal Control; Optimization
Calibration
Clustering
Communication
Energy
Environmental monitoring
Gossip
Graph theory
Graphs
Localization
Management Science
Mathematics
Mathematics and Statistics
Network topologies
Operations Research
Operations Research/Decision Theory
Propagation
Sensors
Studies
Wireless networks
Wireless sensor networks
Gossip-based algorithms
Decentralized clustering
Decentralized aggregation
ISSN:1381-1231, 1572-9397
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We describe VarClust , a gossip-based decentralized clustering algorithm designed to support multi-mean decentralized aggregation in energy-constrained wireless sensor networks. We empirically demonstrate that VarClust is at least as accurate as, and requires less node-to-node communication (and hence consumes less energy) than, a state-of-the-art aggregation approach, affinity propagation. This superiority holds for both the clustering and aggregation phases of inference, and is demonstrated over a range of noise levels and for a range of random and small-world graph topologies.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1381-1231
1572-9397
DOI:10.1007/s10732-014-9259-9