JaccardDissimilarity
JaccardDissimilarity(u, v)
returns the Jaccard-Needham dissimilarity between the two boolean 1-D lists
u
andv
, which is defined as(c_tf + c_ft) / (c_tt + c_ft + c_tf)
, where n islen(u)
andc_ij
is the number of occurrences ofu(k)=i
andv(k)=j
fork<n
.
Examples
>> JaccardDissimilarity({1, 0, 1, 1, 0, 1, 1}, {0, 1, 1, 0, 0, 0, 1})2/3
Implementation status
- ✅ - full supported