Count-Min-Log sketch: Approximately counting with approximate counters
Abstract
Count-Min Sketch is a widely adopted algorithm for approximate event counting in large scale processing. However, the original version of the Count-Min-Sketch (CMS) suffers of some deficiences, especially if one is interested by the low-frequency items, such as in text-mining related tasks. Several variants of CMS have been proposed to compensate for the high relative error for low-frequency events, but the proposed solutions tend to correct the errors instead of preventing them. In this paper, we propose the Count-Min-Log sketch, which uses logarithm-based, approximate counters instead of linear counters to improve the average relative error of CMS at constant memory footprint.
Cite
@article{arxiv.1502.04885,
title = {Count-Min-Log sketch: Approximately counting with approximate counters},
author = {Guillaume Pitel and Geoffroy Fouquier},
journal= {arXiv preprint arXiv:1502.04885},
year = {2015}
}
Comments
7 pages, 3 figures. Some preliminary notes can be found on http://blog.guillaume-pitel.fr/