A Sliding-Window Approach for Finding Top-k Frequent Itemsets from Uncertain Streams.
Xiaojian ZhangHuili PengPublished in: APWeb/WAIM (2009)
Keyphrases
- sliding window
- data streams
- frequent itemsets
- closed frequent itemsets
- mining frequent itemsets
- itemsets
- frequent itemset mining
- stream data
- streaming data
- association rule mining
- mining algorithm
- concept drift
- frequent itemsets mining
- frequent item sets
- continuous queries
- transactional databases
- association rules
- itemset mining
- stream mining
- concise representation
- frequent closed itemsets
- mining association rules
- window size
- discovery of association rules
- data distribution
- fixed size
- query processing
- data sets
- limited memory
- skyline queries
- frequent patterns
- uncertain data
- maximal frequent itemsets
- transactional data
- space efficient
- data stream mining
- condensed representations
- prefix tree
- stream processing
- generalized association rules
- transaction databases
- pruning strategy
- user defined
- high dimensional