Count-Min-Log草图：使用近似计数器进行近似计数
Count-Min-Log sketch: Approximately counting with approximate counters
摘要：
Count-Min Sketch是大规模处理中广泛采用的近似事件计数算法。然而，Count-Min-Sketch（CMS）的原始版本存在一些缺陷，特别是如果对低频项目感兴趣，例如文本挖掘相关任务。已经提出了CMS的几种变体来补偿低频事件的高相对误差，但是所提出的解决方案倾向于校正误差而不是防止误差。在本文中，我们提出了Count-Min-Log的草图，它使用基于递归的近似计数器，而不是线性计数器，以改善CMS的平均相对误差在恒定的内存占用。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
