82 search results - page 4 / 17 » Dynamically maintaining frequent items over a data stream |
PODS
2003
ACM
15 years 9 months ago
2003
ACM
We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a ...
CIDM
2007
IEEE
14 years 9 months ago
2007
IEEE
Data stream applications like sensor network data, click stream data, have data arriving continuously at high speed rates and require online mining process capable of delivering c...
VLDB
2002
ACM
14 years 9 months ago
2002
ACM
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Mining frequent itemsets in data streams is beneficial to many real-world applications but is also a challenging task since data streams are unbounded and have high arrival rates...
94
Voted
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
Incremental mining of sequential patterns from data streams is one of the most challenging problems in mining data streams. However, previous work of mining sequential patterns fr...