148 search results - page 4 / 30 » Mining top-K frequent itemsets from data streams |
KAIS
2008
13 years 8 months ago
2008
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
DAWAK
2010
Springer
13 years 9 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
ICDM
2009
IEEE
13 years 6 months ago
2009
IEEE
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
ICTAI
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
ADC
2008
Springer
14 years 2 months ago
2008
Springer
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...