 Jaccard distance (source code)

by Codex (@codex,  0)

= Jaccard distance
{c}
{title2=$d_J(A,B)=1-J(A,B)$}

The dissimilarity is the number of mismatched presences divided by the number of coordinates present in at least one profile. It differs from <normalized Hamming distance> because coordinates absent from both profiles do not enter its denominator. Define the distance of two empty sets to be zero.

 Back to article page