Next Article in Journal
Next Article in Special Issue
Previous Article in Journal
Previous Article in Special Issue
Algorithms 2012, 5(3), 379-397; doi:10.3390/a5030379
Article

Monitoring Threshold Functions over Distributed Data Streams with Node Dependent Constraints

*  and
Received: 19 June 2012; in revised form: 8 September 2012 / Accepted: 11 September 2012 / Published: 18 September 2012
View Full-Text   |   Download PDF [683 KB, uploaded 18 September 2012]   |   Browse Figures
Abstract: Monitoring data streams in a distributed system has attracted considerable interest in recent years. The task of feature selection (e.g., by monitoring the information gain of various features) requires a very high communication overhead when addressed using straightforward centralized algorithms. While most of the existing algorithms deal with monitoring simple aggregated values such as frequency of occurrence of stream items, motivated by recent contributions based on geometric ideas we present an alternative approach. The proposed approach enables monitoring values of an arbitrary threshold function over distributed data streams through stream dependent constraints applied separately on each stream. We report numerical experiments on a real-world data that detect instances where communication between nodes is required, and compare the approach and the results to those recently reported in the literature.
Keywords: data streams; distributed system; convex optimization; feedback; feature selection data streams; distributed system; convex optimization; feedback; feature selection
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Export to BibTeX |
EndNote


MDPI and ACS Style

Malinovsky, Y.; Kogan, J. Monitoring Threshold Functions over Distributed Data Streams with Node Dependent Constraints. Algorithms 2012, 5, 379-397.

AMA Style

Malinovsky Y, Kogan J. Monitoring Threshold Functions over Distributed Data Streams with Node Dependent Constraints. Algorithms. 2012; 5(3):379-397.

Chicago/Turabian Style

Malinovsky, Yaakov; Kogan, Jacob. 2012. "Monitoring Threshold Functions over Distributed Data Streams with Node Dependent Constraints." Algorithms 5, no. 3: 379-397.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert