Efficient estimation of the cardinality of large data sets

Details Efficient estimation of the cardinality of large data sets Efficient estimation of the cardinality of large data sets

2007-01-12

arxiv.org/abs/math/0701347v3

4th Colloquium on Mathematics and Computer Science, France (2006)

Mathematics

Statistics Theory

Extended and improved version of the published paper

Scientific paper

F.Giroire has recently proposed an algorithm which returns the approximate number of distincts 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.

Affiliated with

Also associated with

No associations

Rating

Efficient estimation of the cardinality of large data sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient estimation of the cardinality of large data sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient estimation of the cardinality of large data sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-218480