Algorithms for clustering data
Algorithms for clustering data
Requirements for clustering data streams
ACM SIGKDD Explorations Newsletter
Distributed clustering using collective principal component analysis
Knowledge and Information Systems
On Clustering Validation Techniques
Journal of Intelligent Information Systems
A General Method for Scaling Up Machine Learning Algorithms and its Application to Clustering
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Modeling of sensor nets in Ptolemy II
Proceedings of the 3rd international symposium on Information processing in sensor networks
Proceedings of the 2006 ACM symposium on Applied computing
Online clustering of parallel data streams
Data & Knowledge Engineering
Distributed Data Mining in Peer-to-Peer Networks
IEEE Internet Computing
A Context Aware Automatic Traffic Notification System for Cell Phones
ICDCSW '07 Proceedings of the 27th International Conference on Distributed Computing Systems Workshops
A framework for clustering evolving data streams
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Hierarchical Clustering of Time-Series Data Streams
IEEE Transactions on Knowledge and Data Engineering
On the Equivalence of Cohen's Kappa and the Hubert-Arabie Adjusted Rand Index
Journal of Classification
Clustering Distributed Time Series in Sensor Networks
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
A system for analysis and prediction of electricity-load streams
Intelligent Data Analysis - Knowledge Discovery from Data Streams
Issues in evaluation of stream learning algorithms
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Distributed clustering based on sampling local density estimates
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Using clustering information for sensor network localization
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Clustering distributed data streams in peer-to-peer environments
Information Sciences: an International Journal
IEEE Communications Magazine
| Hi-index | 0.00 |
In ubiquitous streaming data sources, such as sensor networks, clustering nodes by the data they produce is an important problem that gives insights on the phenomenon being monitored by such networks. However, if these techniques require data to be gathered centrally, communication and storage requirements are often unbounded. The goal of this paper is to assess the feasibility of computing local clustering at each node, using only neighbors' centroids, as an approximation of the global clustering computed by a centralized process. A local algorithm is proposed to perform clustering of sensors based on the moving average of each node's data over time: the moving average of each node is approximated using memory-less fading average; clustering is based on the furthest point algorithm applied to the centroids computed by the node's direct neighbors. The algorithm was evaluated on a state-of-the-art sensor network simulator, measuring the agreement between local and global clustering. Experimental work on synthetic data with spherical Gaussian clusters is consistently analyzed for different network size, number of clusters and cluster overlapping. Results show a high level of agreement between each node's clustering definitions and the global clustering definition, with special emphasis on separability agreement. Overall, local approaches are able to keep a good approximation of the global clustering, improving privacy among nodes, and decreasing communication and computation load in the network. Hence, the basic requirements for distributed clustering of streaming data sensors recommend that clustering on these settings should be performed locally.