Sciweavers

16 search results - page 2 / 4
» The Imaginary Sliding Window As a New Data Structure for Ada...
Sort
View
SDM
2007
SIAM
198views Data Mining» more  SDM 2007»
13 years 6 months ago
Learning from Time-Changing Data with Adaptive Windowing
We present a new approach for dealing with distribution change and concept drift when learning from data sequences that may vary with time. We use sliding windows whose size, inst...
Albert Bifet, Ricard Gavaldà
KDD
2003
ACM
192views Data Mining» more  KDD 2003»
14 years 5 months ago
Efficient elastic burst detection in data streams
Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to mo...
Yunyue Zhu, Dennis Shasha
JCP
2006
111views more  JCP 2006»
13 years 4 months ago
Mining Developing Trends of Dynamic Spatiotemporal Data Streams
This paper1 presents an efficient modeling technique for data streams in a dynamic spatiotemporal environment and its suitability for mining developing trends. The streaming data a...
Yu Meng, Margaret H. Dunham
ICASSP
2011
IEEE
12 years 8 months ago
A sliding-window online fast variational sparse Bayesian learning algorithm
In this work a new online learning algorithm that uses automatic relevance determination (ARD) is proposed for fast adaptive nonlinear filtering. A sequential decision rule for i...
Thomas Buchgraber, Dmitriy Shutin, H. Vincent Poor
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 5 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à