Skip to main content
. Author manuscript; available in PMC: 2013 Oct 1.
Published in final edited form as: Inf Fusion. 2012 Oct 1;13(4):245–259. doi: 10.1016/j.inffus.2011.04.004

Figure 3.

Figure 3

An example of the Bloom filter comparator where each Bloom filter has 10 bits and a single hash function is used to hash each bigram into the filter. The Dice coefficient (Equation 2) is used to determine the similarity of the Bloom filters. The number of intersecting bits in the Bloom filters is 3, the number of bits set in Bloom filter a is 5, and the number of bits set in Bloom filter b is 4, yielding a similarity of 0.67.