Difference between revisions of "Jaccard similarity"

From Cohen Courses
Jump to navigationJump to search
 
(3 intermediate revisions by the same user not shown)
Line 1: Line 1:
== What problem does it address ==
+
Jaccard similarity is used to measure the similarity between two sample sets. Jaccard similarity can be applied to binary sets. An extended version of Jaccard similarity which deals with attributes with counts or continuous values is called [[UsesMethod::Tanimoto coefficient]].
 
 
Jaccard similarity is used to measure the similarity between two sample sets. Jaccard similarity can be applied to binary sets. An extended version of Jaccard similarity which deals with attributes with counts of continuous values is called [[UsesMethod::Tanimoto coefficient]].
 
  
 
== Algorithm ==
 
== Algorithm ==
Line 20: Line 18:
 
:<math> \text{Jaccard similarity} = \mathbf{J} = \frac{ M_{11} }{ M_{01} + M_{10} + M_{00} }</math>
 
:<math> \text{Jaccard similarity} = \mathbf{J} = \frac{ M_{11} }{ M_{01} + M_{10} + M_{00} }</math>
  
 +
:<math> \text{Jaccard dissimilarity} = 1 - \mathbf{J} </math>
  
 
== Relevant Papers ==
 
== Relevant Papers ==

Latest revision as of 21:21, 30 March 2011

Jaccard similarity is used to measure the similarity between two sample sets. Jaccard similarity can be applied to binary sets. An extended version of Jaccard similarity which deals with attributes with counts or continuous values is called Tanimoto coefficient.

Algorithm

  • Input

The size of A and B are same.

  • Output

Relevant Papers