Maintaining frequency counts for items over data stream has a wide range of applications such as web advertisement fraud detection. Study of this problem has attracted great attention from both researchers and practitioners. Many algorithms have been proposed. In this paper, we propose a new method, error-adaptive pruning method, to maintain frequency more accurately. We also propose a method called fractionization to record time information together with the frequency information. Using these two methods, we design three algorithms for finding frequent items and top-k frequent items. Experimental results show these methods are effective in terms of improving the maintenance accuracy. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Liu, H., Lu, Y., Han, J., & He, J. (2006). Error-adaptive and time-aware maintenance of frequency counts over data streams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4016 LNCS, pp. 484–495). Springer Verlag. https://doi.org/10.1007/11775300_41
Mendeley helps you to discover research relevant for your work.