.png){kind=icon}
返回
Cardinality Estimation Meets Good-Turing
.png){kind=icon}
OA
AI
DOI：10.1016/j.bdr.2017.04.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Cardinality estimation algorithms receive a stream of elements whose order might be arbitrary, with possible repetitions, and return the number of distinct elements. Such algorithms usually seek to minimize the required storage and processing at the price of inaccuracy in their output. Real-world applications of these algorithms are required to process large volumes of monitored data, making it impractical to collect and analyze the entire input stream. In such cases, it is common practice to sample and process only a small part of the stream elements. This paper presents and analyzes a generic algorithm for combining every cardinality estimation algorithm with a sampling process. We show that the proposed sampling algorithm does not affect the estimator's asymptotic unbiasedness, and we analyze the sampling effect on the estimator's variance. (C) 2017 Elsevier Inc. All rights reserved.
Keyword:
Cardinality estimation
Sampling
HyperLogLog
Good-Turing
Data sketch
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
418
被引数:
1.1K
机构
引用论文
分享收藏Increased medial orbitofrontal [18F]fluorodopa uptake in Parkinsonian impulse control disorders
PREAI
分享收藏分享收藏A NORMAL LIMIT LAW FOR A NONPARAMETRIC ESTIMATOR OF THE COVERAGE OF A RANDOM SAMPLE.png)
ANNALS OF STATISTICSOAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏 没有更多内容
没有更多内容