Jaccard index

From Wikipedia, the free encyclopedia
  (Redirected from Jaccard coefficient)
Jump to: navigation, search

The Jaccard index, also known as the Jaccard similarity coefficient (originally coined coefficient de communauté by Paul Jaccard), is a statistic used for comparing the similarity and diversity of sample sets. The Jaccard coefficient measures similarity between finite sample sets, and is defined as the size of the intersection divided by the size of the union of the sample sets:

 J(A,B) = {{|A \cap B|}\over{|A \cup B|}}.

(If A and B are both empty, we define J(A,B) = 1.) Clearly,

 0\le J(A,B)\le 1.

The MinHash min-wise independent permutations locality sensitive hashing scheme may be used to efficiently compute an accurate estimate of the Jaccard similarity coefficient of pairs of sets, where each set is represented by a constant-sized signature derived from the minimum values of a hash function.

The Jaccard distance, which measures dissimilarity between sample sets, is complementary to the Jaccard coefficient and is obtained by subtracting the Jaccard coefficient from 1, or, equivalently, by dividing the difference of the sizes of the union and the intersection of two sets by the size of the union:

 d_J(A,B) = 1 - J(A,B) = { { |A \cup B| - |A \cap B| } \over |A \cup B| }.

An alternate interpretation of the Jaccard distance is as the ratio of the size of the symmetric difference A \triangle B = (A \cup B) - (A \cap B) to the union.

This distance is a proper metric on sets of sets.[1][2]

There is also a version of the Jaccard distance for measures, including probability measures. If \mu is a measure on a measurable space X, then we define the Jaccard coefficient by J_\mu(A,B) = {{\mu(A \cap B)} \over {\mu(A \cup B)}}, and the Jaccard distance by d_\mu(A,B) = 1 - J_\mu(A,B) = {{\mu(A \triangle B)} \over {\mu(A \cup B)}}. Care must be taken if \mu(A \cup B) = 0 or \infty, since these formulas are not well defined in that case.

Similarity of asymmetric binary attributes[edit]

Given two objects, A and B, each with n binary attributes, the Jaccard coefficient is a useful measure of the overlap that A and B share with their attributes. Each attribute of A and B can either be 0 or 1. The total number of each combination of attributes for both A and B are specified as follows:

M_{11} represents the total number of attributes where A and B both have a value of 1.
M_{01} represents the total number of attributes where the attribute of A is 0 and the attribute of B is 1.
M_{10} represents the total number of attributes where the attribute of A is 1 and the attribute of B is 0.
M_{00} represents the total number of attributes where A and B both have a value of 0.

Each attribute must fall into one of these four categories, meaning that

M_{11} + M_{01} + M_{10} + M_{00} = n.

The Jaccard similarity coefficient, J, is given as

J = {M_{11} \over M_{01} + M_{10} + M_{11}}.

The Jaccard distance, dJ, is given as

d_J = {M_{01} + M_{10} \over M_{01} + M_{10} + M_{11}}.

Generalized Jaccard similarity and distance[edit]

If \mathbf{x} = (x_1, x_2, \ldots, x_n) and \mathbf{y} = (y_1, y_2, \ldots, y_n) are two vectors with all real x_i, y_i \geq 0, then their Jaccard similarity coefficient is defined as

J(\mathbf{x}, \mathbf{y}) = \frac{\sum_i \min(x_i, y_i)}{\sum_i \max(x_i, y_i)},

and Jaccard distance

d_J(\mathbf{x}, \mathbf{y}) = 1 - J(\mathbf{x}, \mathbf{y}).

With even more generality, if f and g are two non-negative measurable functions on a measurable space X with measure \mu, then we can define

J(f, g) = \frac{\int\min(f, g) d\mu}{\int \max(f, g)  d\mu},

where \max and \min are pointwise operators. Then Jaccard distance is

d_J(f, g) = 1 - J(f, g).

Then, for example, for two measurable sets A, B \subseteq X, we have J_\mu(A,B) = J(\chi_A, \chi_B), where \chi_A and \chi_B are the characteristic functions of the corresponding set.

Tanimoto similarity and distance[edit]

Various forms of functions described as Tanimoto similarity and Tanimoto distance occur in the literature and on the Internet. Most of these are synonyms for Jaccard similarity and Jaccard distance, but some are mathematically different. Many sources[3] cite an unavailable IBM Technical Report[4] as the seminal reference.

In "A Computer Program for Classifying Plants", published in October 1960,[5] a method of classification based on a similarity ratio, and a derived distance function, is given. It seems that this is the most authoritative source for the meaning of the terms "Tanimoto similarity" and "Tanimoto Distance". The similarity ratio is equivalent to Jaccard similarity, but the distance function is not the same as Jaccard distance.

Tanimoto's definitions of similarity and distance[edit]

In that paper, a "similarity ratio" is given over bitmaps, where each bit of a fixed-size array represents the presence or absence of a characteristic in the plant being modelled. The definition of the ratio is the number of common bits, divided by the number of bits set in either sample.

Presented in mathematical terms, if samples X and Y are bitmaps, X_i is the ith bit of X, and  \land , \lor are bitwise and, or operators respectively, then the similarity ratio T_s is

 T_s(X,Y) =  \frac{\sum_i ( X_i \land Y_i)}{\sum_i ( X_i \lor Y_i)}

If each sample is modelled instead as a set of attributes, this value is equal to the Jaccard Coefficient of the two sets. Jaccard is not cited in the paper, and it seems likely that the authors were not aware of it.

Tanimoto goes on to define a distance coefficient based on this ratio, defined over values with non-zero similarity:

T_d(X,Y) = -\log_2 ( T_s(X,Y) )

This coefficient is, deliberately, not a distance metric. It is chosen to allow the possibility of two specimens, which are quite different from each other, to both be similar to a third. It is easy to construct an example which disproves the property of triangle inequality.

Other definitions of Tanimoto distance[edit]

Tanimoto distance is often referred to, erroneously, as a synonym for Jaccard distance ( 1 - T_s). This function is a proper distance metric. "Tanimoto Distance" is often stated as being a proper distance metric, probably because of its confusion with Jaccard distance.

If Jaccard or Tanimoto similarity is expressed over a bit vector, then it can be written as


f(A,B) =\frac{ A \cdot B}{\vert A\vert^2 +\vert B\vert^2 -  A \cdot B }

where the same calculation is expressed in terms of vector scalar product and magnitude. This representation relies on the fact that, for a bit vector (where the value of each dimension is either 0 or 1) then A \cdot B = \sum_i A_iB_i = \sum_i ( A_i \land B_i) and {\vert A\vert}^2 = \sum_i A_i^2 = \sum_i A_i .

This is a potentially confusing representation, because the function as expressed over vectors is more general, unless its domain is explicitly restricted. Properties of  T_s do not necessarily extend to f. In particular, the difference function ( 1 - f) does not preserve triangle inequality, and is not therefore a proper distance metric, whereas ( 1 - T_s) is.

There is a real danger that the combination of "Tanimoto Distance" being defined using this formula, along with the statement "Tanimoto Distance is a proper distance metric" will lead to the false conclusion that the function (1 - f) is in fact a distance metric over vectors or multisets in general, whereas its use in similarity search or clustering algorithms may fail to produce correct results.

Lipkus[1] uses a definition of Tanimoto similarity which is equivalent to f, and refers to Tanimoto distance as the function  (1 - f) . It is however made clear within the paper that the context is restricted by the use of a (positive) weighting vector W such that, for any vector A being considered,  A_i \in \{0,W_i\} . Under these circumstances, the function is a proper distance metric, and so a set of vectors governed by such a weighting vector forms a metric space under this function.

See also[edit]

Notes[edit]

  1. ^ a b Lipkus, Alan H (1999), "A proof of the triangle inequality for the Tanimoto distance", J Math Chem 26 (1-3): 263–265 
  2. ^ Levandowsky, Michael; Winter, David (1971), "Distance between sets", Nature 234 (5): 34–35, doi:10.1038/234034a0 
  3. ^ For example Qian, Huihuan; Wu, Xinyu; Xu, Yangsheng (2011). Intelligent Surveillance Systems. Springer. p. 161. ISBN 978-94-007-1137-2. 
  4. ^ Tanimoto, T. (17 Nov 1957). "An Elementary Mathematical theory of Classification and Prediction". Internal IBM Technical Report 1957 (8?). 
  5. ^ Rogers, David J.; Tanimoto, Taffee T. (1960). "A Computer Program for Classifying Plants". Science 132 (3434): 1115–1118. doi:10.1126/science.132.3434.1115. 

References[edit]

  • Tan, Pang-Ning; Steinbach, Michael; Kumar, Vipin (2005), Introduction to Data Mining, ISBN 0-321-32136-7 .
  • Jaccard, Paul (1901), "Étude comparative de la distribution florale dans une portion des Alpes et des Jura", Bulletin de la Société Vaudoise des Sciences Naturelles 37: 547–579 .
  • Jaccard, Paul (1912), "The distribution of the flora in the alpine zone", New Phytologist 11: 37–50, doi:10.1111/j.1469-8137.1912.tb05611.x .

External links[edit]