JaccardDissimilarity
Jaccard index (SciPy, WMA)
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$.
JaccardDissimilarity[{1, 0, 1, 1, 0, 1, 1}, {0, 1, 1, 0, 0, 0, 1}]