Sciweavers

373 search results - page 67 / 75
» Mining time-changing data streams
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
ICDM
2008
IEEE
145views Data Mining» more  ICDM 2008»
14 years 1 months ago
Paired Learners for Concept Drift
To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas a reactive learner predicts ba...
Stephen H. Bach, Marcus A. Maloof
PODS
2010
ACM
215views Database» more  PODS 2010»
14 years 17 days ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
KDD
2004
ACM
209views Data Mining» more  KDD 2004»
14 years 8 months ago
Tracking dynamics of topic trends using a finite mixture model
In a wide range of business areas dealing with text data streams, including CRM, knowledge management, and Web monitoring services, it is an important issue to discover topic tren...
Satoshi Morinaga, Kenji Yamanishi
SIGMOD
2009
ACM
177views Database» more  SIGMOD 2009»
14 years 7 months ago
ORDEN: outlier region detection and exploration in sensor networks
Sensor networks play a central role in applications that monitor variables in geographic areas such as the traffic volume on roads or the temperature in the environment. A key fea...
Conny Franke, Michael Gertz