Frequent Itemset Mining in Transactional Data Streams Based on Quality Control and Resource Adaptation

The increasing importance of data stream arising in a wide range of advanced applications has led to theextensive study of mining frequent patterns. Mining data streams poses many new challenges amongstwhich are the one-scan nature, the unbounded memory requirement and the high arrival rate of datastreams.Further the usage of memory resources should be taken care of regardless of the amount of datagenerated in the stream. In this work we extend the ideas of existing proposals to ensure efficient resourceutilization and quality control. The proposed algorithm RAQ-FIG (Resource Adaptive Quality AssuringFrequent Item Generation) accounts for the computational resources like memory available anddynamically adapts the rate of processing based on the available memory. It will compute the recentapproximate frequent itemsets by using a single pass algorithm. The empirical results demonstrate theefficacy of the proposed approach for finding recent frequent itemsets from a data stream.