Jaccard Distance
algorithm, distance
Solution
Size of intersection = 3; (How could we find it out?)
Amount of set bits of `p1&p2 = 10011`
Size of union = 4, (How could we find it out?)
Amount of set bits of `p1|p2 = 10111`
Vector here means binary array where i-th bit means does i-th element present in this set.
Problem
I have this problem in calculating Jaccard Distance for Sets (Bit-Vectors): p1 = 10111; p2 = 10011. Size of intersection = 3; (How could we find it out?) Size of union = 4, (How could we find it out?) Jaccard similarity = (intersection/union) = 3/4. Jaccard Distance = 1 – (Jaccard similarity) = (1-3/4) = 1/4. But I don't understand how could we find out the "intersection" and "union" of the two vectors. Please help me. Thanks alot.