A Statistical Analysis of Probabilistic Counting Algorithms

DOI10.1111/j.1467-9469.2010.00727.xzbMath1246.62003arXiv0801.3552OpenAlexW2114027169MaRDI QIDQ2911701

Peter Clifford, Ioana A. Cosma

Publication date: 1 September 2012

Published in: Scandinavian Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0801.3552

zbMATH Keywords

maximum likelihood estimationasymptotic relative efficiencycardinalityhash functionstable distributiondata streamsspace complexitytail boundsdata sketching

Mathematics Subject Classification ID

Order statistics; empirical distribution functions (62G30)

Uses Software

• STABLE

Cites Work

• Order statistics and estimating cardinalities of massive data sets
• Probabilistic counting algorithms for data base applications
• Pseudorandom generators for space-bounded computation
• Universal classes of hash functions
• The space complexity of approximating the frequency moments
• A result in order statistics related to probabilistic counting
• Data streams. Models and algorithms.
• Stable distributions, pseudorandom generators, embeddings, and data stream computation
• Numerical calculation of stable densities and distribution functions
• An improved data stream summary: the count-min sketch and its applications
• Linear Statistical Inference and its Applications
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Algorithms - ESA 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item