Difference between revisions of "Jaccard similarity"
From Cohen Courses
Jump to navigationJump to searchLine 1: | Line 1: | ||
− | |||
− | |||
== What problem does it address == | == What problem does it address == | ||
− | + | Jaccard similarity is used to measure the similarity between two sample sets. | |
== Algorithm == | == Algorithm == | ||
Line 15: | Line 13: | ||
* Output | * Output | ||
− | |||
:<math> \mathbf{M_{11}} : \text{the number of attributes where A is 1 and B is 1}</math> | :<math> \mathbf{M_{11}} : \text{the number of attributes where A is 1 and B is 1}</math> | ||
:<math> \mathbf{M_{01}} : \text{the number of attributes where A is 0 and B is 1}</math> | :<math> \mathbf{M_{01}} : \text{the number of attributes where A is 0 and B is 1}</math> | ||
Line 23: | Line 20: | ||
:<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> | ||
− | |||
− | |||
− | |||
− | |||
− | |||
== Relevant Papers == | == Relevant Papers == |
Revision as of 21:12, 30 March 2011
What problem does it address
Jaccard similarity is used to measure the similarity between two sample sets.
Algorithm
- Input
The size of A and B are same.
- Output