Sciweavers

85 search results - page 1 / 17
» An Efficient Algorithm for Maintaining Frequent Closed Items...
Sort
View
IEAAIE
2009
Springer
13 years 9 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
JIIS
2008
133views more  JIIS 2008»
13 years 2 months ago
Maintaining frequent closed itemsets over a sliding window
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...
James Cheng, Yiping Ke, Wilfred Ng
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 2 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
KAIS
2006
110views more  KAIS 2006»
13 years 2 months ago
Catch the moment: maintaining closed frequent itemsets over a data stream sliding window
Yun Chi, Haixun Wang, Philip S. Yu, Richard R. Mun...
DAWAK
2010
Springer
13 years 3 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
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...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar