Mining Weighted Frequent Itemsets Using Window Sliding over Data Streams

Abstract

In this paper, we considers the problem of mining with weighted support over a data stream sliding window using limited memory space. The continuous characteristic of streaming data necessitates the use of algorithms that require only one scan over the stream for knowledge discovery. This paper focuses on research issues concerning mining frequent itemsets in data streams and we suggests an efficient algorithm WSFI-Mine to mine all frequent itemsets. Our experiment show that our algorithm not only achieved effectively consumes less memory, but also runs significantly faster than THUI-mine.

Related Papers

• → A Sliding Window Method for Finding Recently Frequent Itemsets over Online Data Streams(2004)138 cited
• → An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams(2006)17 cited
• Mining the Frequent Patterns in an Arbitrary Sliding Window over Online Data Streams(2008)
• An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams*(2015)
• → Trends in Data Stream Mining(2023)