Marios Hadjieleftheriou/Frequent Items: Evaluation Source Code
This package provides implementations of various one pass algorithms for finding frequent items in data streams. In particular it contains the following:The code is an extension of the MassDAL library. Implementations are by Graham Cormode.
- Frequent Algorithm
- Lossy Counting, and variations
- Space Saving
- Greewald & Khanna
- Quantile Digest
- Count Sketch
- Hierarchical Count-Min Sketch
- Combinatorial Group Testing
Download:
