Answers are grounded in this paper and cite their sources.
Giroire has recently proposed an algorithm which returns the approximate number of distinct elements in a large sequence of words, under strong constraints coming from the analysis of large data bases. His estimation is based on statistical properties of uniform random variables in $[0,1]$. In this note we propose an optimal estimation, using Kullback information and estimation theory.
No takes yet. Share an insight, caveat, or question.
Chassaing et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: