Frequent Items Mining on Data Stream Based on Time Fading Factor

Abstract

Most of the existing algorithms for mining frequent items on data stream do not emphasis the importance of the recent data items. We present an algorithm using a fading factor to detect the data items with frequency counts exceeding a user-specified threshold. Our algorithm can detect ¿-approximate frequent data items on data stream using O(¿ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-1</sup> ) memory space and the processing time for each data item and a query is O(¿ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-1</sup> ). Experimental results on several artificial datasets and real datasets show our algorithm has higher precision, requires less memory and consumes less computation time than other similar methods.