Today I stumbled upon the term Tanimoto score. It’s quite surprising that the search turned up only 2680 results so I had to do more digging than the usual. The search led me to the terms Tanimoto similarity and distance, which reminded me of the Jaccard similarity and distance.
Surprisingly, Tanimoto similarity and distance are sometimes used interchangibly with Jaccard similarity and distance. Some uses are referring to the same formula, but others are actually mathematically different. The similarity ratio given by Tanimoto similarity is equivalent to Jaccard similarity, but the distance function isn’t the same as Jaccard distance.
First appeared in the paper “A Computer Program for Classifying Plants” which was published in 1950, the similarity ratio is given over bitmaps. In the paper, each bit of a fixed-size array represents the presence or absence of a characteristic in the plant being modelled.
Tanimoto similarity is given by the number of common bits divided by the number of nonzero bits in either sample.
If samples X and Y are bitmaps, is the i-th bit of X, is bitwise and, and is bitwise or operator, then the similarity ratio is:
If we model X and Y as sets of attributes instead of bits, we can see that it will give the same result as the Jaccard similarity:
Tanimoto then defines a distance coefficient based on the ratio above:
However, the Tanimoto distance is not a proper distance metric since it violates the triangle inequality. This definition of Tanimoto distance allows the possibility of two specimens, which are quite different from each other, to both be similar to a third.