On the computation of Shannon Entropy from Counting Bloom Filters

02/19/2018
by   Michael Cochez, et al.
0

In this short note a method for computing the naive plugin estimator of discrete entropy from a counting Bloom filter will be presented. The method does work reasonably as long as the collision probability in the bloom filter is kept low.

READ FULL TEXT

page 1

page 2

page 3

research
09/08/2020

Shannon entropy estimation for linear processes

In this paper, we estimate the Shannon entropy S(f) = -[ log (f(x))] of ...
research
01/04/2021

Split block Bloom filters

This short note describes a Bloom filter variant that takes advantage of...
research
08/14/2022

Cellular liberality is measurable as Lempel-Ziv complexity of fastq files

Many studies used the Shannon entropy of transcriptome data to determine...
research
05/09/2012

Improving Compressed Counting

Compressed Counting (CC) [22] was recently proposed for estimating the a...
research
06/06/2021

robustBF: A High Accuracy and Memory Efficient 2D Bloom Filter

Bloom Filter is an important probabilistic data structure to reduce memo...
research
12/02/2021

A short note on the counting complexity of conjunctive queries

This note closes a minor gap in the literature on the counting complexit...
research
03/04/2022

MF-Hovernet: An Extension of Hovernet for Colon Nuclei Identification and Counting (CoNiC) Challenge

Nuclei Identification and Counting is the most important morphological f...

Please sign up or login with your details

Forgot password? Click here to reset