85 search results - page 8 / 17 » An Efficient Algorithm for Maintaining Frequent Closed Items... |
LWA
2004
13 years 9 months ago
2004
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
ICDM
2006
IEEE
14 years 1 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...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distr...