Go to:
Logótipo
Você está em: Start > Publications > View > Network Comprehension by Clustering Streaming Sensors
Map of Premises
Principal
Publication

Network Comprehension by Clustering Streaming Sensors

Title
Network Comprehension by Clustering Streaming Sensors
Type
Article in International Conference Proceedings Book
Year
2010
Authors
João Gama
(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
João Araújo
(Author)
FCUP
View Personal Page Search for Participant Publications Without AUTHENTICUS Without ORCID
Luís Lopes
(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: 35-44
4th International Workshop on Knowledge Discovery from Sensor Data (Sensor-KDD 2010)
Washington, DC, 25 - 28 July, 2010
Scientific classification
FOS: Natural sciences > Computer and information sciences
CORDIS: Physical sciences > Computer science
Other information
Abstract (EN): Sensor network comprehension tries to extract information about global interaction between sensors by looking at the data they produce. When no other information is available to extract, usual knowledge discovery approaches are based on unsupervised techniques. However, if these techniques require data to be gathered centrally, communication and storage requirements are often unbounded. The goal of this paper is to discuss sensor network comprehension techniques, presenting a local algorithm to compute clustering of sensors at each node, using only neighbors' centroids, as an approximation of the global clustering of streaming sensors computed by a centralized process. The clustering algorithm is based on the moving average of each node's data over time: the moving average of each node is approximated using memoryless 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 bewteen local and global clustering. Results show a high level of agreement between each node's clustering de nitions and the global clustering de nition, with special emphasis on separability agreement. Overall, local approaches are able to keep a good approximation of the global clustering, improving the ability to keep global network comprehension at each sensor node, with increased privacy, and decreased communication and computation load in the network.
Language: English
Type (Professor's evaluation): Scientific
Contact: lmlopes@fc.up.pt
Notes: Disponível em: http://www.ornl.gov/sci/knowledgediscovery/SensorKDD-2010/SensorKDD'10_Proceedings.pdf
Documents
We could not find any documents associated to the publication.
Related Publications

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

See all (138)

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
Page created on: 2025-07-08 at 23:00:08 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book