mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-30 16:31:08 +00:00
07e991d553
* ci(pre-commit): Add pep8-naming to `pre-commit` hooks (#7038) * refactor: Fix naming conventions (#7038) * Update arithmetic_analysis/lu_decomposition.py Co-authored-by: Christian Clauss <cclauss@me.com> * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * refactor(lu_decomposition): Replace `NDArray` with `ArrayLike` (#7038) * chore: Fix naming conventions in doctests (#7038) * fix: Temporarily disable project euler problem 104 (#7069) * chore: Fix naming conventions in doctests (#7038) Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
81 lines
2.4 KiB
Python
81 lines
2.4 KiB
Python
"""
|
|
The Jaccard similarity coefficient is a commonly used indicator of the
|
|
similarity between two sets. Let U be a set and A and B be subsets of U,
|
|
then the Jaccard index/similarity is defined to be the ratio of the number
|
|
of elements of their intersection and the number of elements of their union.
|
|
|
|
Inspired from Wikipedia and
|
|
the book Mining of Massive Datasets [MMDS 2nd Edition, Chapter 3]
|
|
|
|
https://en.wikipedia.org/wiki/Jaccard_index
|
|
https://mmds.org
|
|
|
|
Jaccard similarity is widely used with MinHashing.
|
|
"""
|
|
|
|
|
|
def jaccard_similariy(set_a, set_b, alternative_union=False):
|
|
"""
|
|
Finds the jaccard similarity between two sets.
|
|
Essentially, its intersection over union.
|
|
|
|
The alternative way to calculate this is to take union as sum of the
|
|
number of items in the two sets. This will lead to jaccard similarity
|
|
of a set with itself be 1/2 instead of 1. [MMDS 2nd Edition, Page 77]
|
|
|
|
Parameters:
|
|
:set_a (set,list,tuple): A non-empty set/list
|
|
:set_b (set,list,tuple): A non-empty set/list
|
|
:alternativeUnion (boolean): If True, use sum of number of
|
|
items as union
|
|
|
|
Output:
|
|
(float) The jaccard similarity between the two sets.
|
|
|
|
Examples:
|
|
>>> set_a = {'a', 'b', 'c', 'd', 'e'}
|
|
>>> set_b = {'c', 'd', 'e', 'f', 'h', 'i'}
|
|
>>> jaccard_similariy(set_a, set_b)
|
|
0.375
|
|
|
|
>>> jaccard_similariy(set_a, set_a)
|
|
1.0
|
|
|
|
>>> jaccard_similariy(set_a, set_a, True)
|
|
0.5
|
|
|
|
>>> set_a = ['a', 'b', 'c', 'd', 'e']
|
|
>>> set_b = ('c', 'd', 'e', 'f', 'h', 'i')
|
|
>>> jaccard_similariy(set_a, set_b)
|
|
0.375
|
|
"""
|
|
|
|
if isinstance(set_a, set) and isinstance(set_b, set):
|
|
|
|
intersection = len(set_a.intersection(set_b))
|
|
|
|
if alternative_union:
|
|
union = len(set_a) + len(set_b)
|
|
else:
|
|
union = len(set_a.union(set_b))
|
|
|
|
return intersection / union
|
|
|
|
if isinstance(set_a, (list, tuple)) and isinstance(set_b, (list, tuple)):
|
|
|
|
intersection = [element for element in set_a if element in set_b]
|
|
|
|
if alternative_union:
|
|
union = len(set_a) + len(set_b)
|
|
else:
|
|
union = set_a + [element for element in set_b if element not in set_a]
|
|
|
|
return len(intersection) / len(union)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
|
|
set_a = {"a", "b", "c", "d", "e"}
|
|
set_b = {"c", "d", "e", "f", "h", "i"}
|
|
print(jaccard_similariy(set_a, set_b))
|