A quick algorithm for incremental mining closed frequent itemsets over data streams

Shankar B. Naik, Jyoti D. Pawar · 2015

In this paper we have proposed an efficient algorithm QMINE to find closed frequent itemsets over a data stream. Our approach performs a few operations. Experiments have shown that our approach outperforms the previous approaches, significantly.

Read the paper · More papers on PaperTik