Mining frequent items in the time fading model

  title={Mining frequent items in the time fading model},
  author={Massimo Cafaro and Marco Pulimeno and Italo Epicoco and Giovanni Aloisio},
  journal={Inf. Sci.},
We present FDCMSS, a new sketch based algorithm for mining fr equent items in data streams. The algorithm cleverly combines key ideas borrowed from forward decay, the Count-M i and the Space Saving algorithms. It works in the time fading model, mining data streams according to the cash register model. We formally prove its correctness and show, through extensive experimental results, that our algorithm outperformsλ-HCount, a recently developed algorithm, with regard to speed, space used… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 10 times over the past 90 days. VIEW TWEETS
5 Citations
34 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 34 references

Tempest a, A parallel space saving algorithm for frequent items and the hurwitz zeta distribution, Information

  • Massimo Cafaro, Marco Pulimeno, Piergiulio
  • Sciences 329(2016),
  • 2016
1 Excerpt

the weighted lossy counting algorithm in hig h-speed network monitoring , Instrumentation, measurement, computer, communication and control (imccc), second international c onference

  • Yu Zhang, Parallelizing
  • 2012
3 Excerpts

Similar Papers

Loading similar papers…