We proposed a new algorithm SuffixMiner which eliminates the requirement of multiple passes through the data when finding out all frequent itemsets in data ...

We propose a novel approach for mining recent frequent itemsets. The approach has three key contributions. First, it is a single-scan algorithm which utilizes ...

Abstract. We proposed a new algorithm SuffixMiner which eliminates the re- quirement of multiple passes through the data when finding out all frequent.

Experiment results show that the SuffixMiner algorithm not only has an excellent scalability to mine frequent itemsets over data streams, but also outperforms ...

We proposed a new algorithm SuffixMiner which eliminates the requirement of multiple passes through the data when finding out all frequent itemsets.

Read A high-efficiency algorithm for Mining Frequent Itemsets over transaction data streams.

SuffixMiner: Efficiently Mining Frequent Itemsets in Data Streams by Suffix-Forest ... Mining Recent Frequent Itemsets in Data Streams by Radioactively ...

Mining frequent item sets (frequent patterns) in transaction databases is a well known problem in data mining research. This work proposes a sampling-based ...

[Show full abstract] data streams. Experiment results show that the SuffixMiner algorithm not only has an excellent scalability to mine frequent itemsets over ...