Go to:
Logótipo
Você está em: Start > Publications > View > L2GClust: local-to-global clustering of stream sources
Map of Premises
Principal
Publication

L2GClust: local-to-global clustering of stream sources

Title
L2GClust: local-to-global clustering of stream sources
Type
Article in International Conference Proceedings Book
Year
2011
Authors
Gama, J
(Author)
FEP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Araujo, J
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Lopes, L
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Conference proceedings International
Pages: 1006-1011
26th Annual ACM Symposium on Applied Computing, SAC 2011
TaiChung, 21 March 2011 through 24 March 2011
Indexing
Publicação em ISI Web of Knowledge ISI Web of Knowledge
Scientific classification
CORDIS: Physical sciences > Computer science
Other information
Authenticus ID: P-00H-Z2P
Abstract (EN): 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. © 2011 ACM.
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

A local algorithm to approximate the global clustering of streams generated in ubiquitous sensor networks (2018)
Article in International Scientific Journal
Pedro Pereira Rodrigues; Araujo, J; João Gama; Lopes, L

Of the same scientific areas

On Applying Linear Tabling to Logic Programs (2010)
Thesis
MIGUEL AREIAS; Ricardo Rocha
APRIORI Algorithm for Label Ranking (2010)
Thesis
Cláudio Sá; Carlos Soares; Joaquim Costa
On the average size of pd automata: an analytic combinatorics approach (2010)
Technical Report
Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis
On Covering Path Orthogonal Polygons (preliminary version) (2016)
Technical Report
Ana Paula Tomás; Catarina Lobo Ferreira
Introdução ao método dos elementos finitos (1998)
Technical Report
João Manuel Ribeiro Silva Tavares; Armando Jorge Monteiro Neves Padilha

See all (192)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Medicina Dentária da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z  I Guest Book
Page created on: 2025-07-08 at 12:44:59 | Acceptable Use Policy | Data Protection Policy | Complaint Portal