Sciweavers

2775 search results - page 96 / 555
» Differencing Data Streams
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
16 years 3 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
VLDB
2005
ACM
140views Database» more  VLDB 2005»
15 years 8 months ago
Loadstar: Load Shedding in Data Stream Mining
In this demo, we show that intelligent load shedding is essential in achieving optimum results in mining data streams under various resource constraints. The Loadstar system intro...
Yun Chi, Haixun Wang, Philip S. Yu
DASFAA
2007
IEEE
202views Database» more  DASFAA 2007»
15 years 9 months ago
Optimizing Moving Queries over Moving Object Data Streams
With the increasing in demand on location-based aware services and RFIDs, efficient processing of continuous queries over moving object streams becomes important. In this paper, w...
Dan Lin, Bin Cui, Dongqing Yang
PODS
2003
ACM
143views Database» more  PODS 2003»
16 years 3 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
103
Voted
PAAPP
2008
76views more  PAAPP 2008»
15 years 2 months ago
Group-aware stream filtering for bandwidth-efficient data dissemination
In this paper 1 we are concerned with disseminating high-volume data streams to many simultaneous applications over a low-bandwidth wireless mesh network. For bandwidth efficiency...
Ming Li, David Kotz