171 search results - page 11 / 35 » Statistical Supports for Frequent Itemsets on Data Streams |
KDD
2006
ACM
16 years 2 days ago
2006
ACM
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
101
Voted
PAKDD
2007
ACM
15 years 5 months ago
2007
ACM
Catching the recent trend of data is an important issue when mining frequent itemsets from data streams. To prevent from storing the whole transaction data within the sliding windo...
VLDB
2002
ACM
14 years 11 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...
103
Voted
PKDD
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
100
Voted
SDM
2004
SIAM
15 years 1 months ago
2004
SIAM
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...