JaccardDissimilarity

JaccardDissimilarity(u, v)

returns the Jaccard-Needham dissimilarity between the two boolean 1-D lists u and v, which is defined as (c_tf + c_ft) / (c_tt + c_ft + c_tf), where n is len(u) and c_ij is the number of occurrences of u(k)=i and v(k)=j for k<n.

Examples

>> JaccardDissimilarity({1, 0, 1, 1, 0, 1, 1}, {0, 1, 1, 0, 0, 0, 1})
2/3

Implementation status

• ✅ - full supported

Github

• Implementation of JaccardDissimilarity