Dynamically Maintaining Frequent Items over a Data Stream (2003) [21 citations — 2 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Cheqing Jin and Weining Qian and Chaofeng Sha and Jeffrey X. Yu and Aoying Zhou},
title = {Dynamically Maintaining Frequent Items over a Data Stream},
booktitle = {In Proc. Of CIKM},
year = {2003},
pages = {287--294},
publisher = {ACM Press}
}
Bookmarks
OpenURL
Abstract:
It is challenge to maintain frequent items over a data stream, with a small bounded memory, in a dynamic environment where both insertion/deletion of items are allowed. In this paper, we propose a new novel algorithm, called hCount, which can handle both insertion and deletion of items with a much less memory space than the best reported algorithm. Our algorithm is also superior in terms of precision, recall and processing time. In addition, our approach does not request the preknowledge on the size of range for a data stream, and can handle range extension dynamically. Given a little modification, algorithm hCount can be improved to hCount*, which even owns significantly better performance than before.
Citations
| 1735 | Fast Algorithms for Mining Association Rules – Agrawal, Srikant - 1994 |
| 395 | The space complexity of approximating the frequency moments – Alon, Matias, et al. - 1999 |
| 1 | Models and issurs in data streams – Babcock, Babu, et al. |
