Jaccard similarity measures the overlap between two collections after duplicates are removed. Form sets A and B from the input lists, then compute
J(A,B)=∣A∪B∣∣A∩B∣Here, the numerator counts items shared by both sets, while the denominator counts distinct items present in either set. If both sets are empty, return 0.0. Otherwise return the similarity as a float.
Input: set_a = [1, 2, 3], set_b = [2, 3, 4]
Output: 0.500000
Explanation: The intersection has two items and the union has four, giving 2 / 4 = 0.5.
Input: set_a = [1, 2], set_b = [3, 4]
Output: 0.000000
Convert both lists to sets before measuring overlap.
Handle an empty union before performing the division.
Accepts: array
Accepts: array
Jaccard similarity measures the overlap between two collections after duplicates are removed. Form sets A and B from the input lists, then compute
J(A,B)=∣A∪B∣∣A∩B∣Here, the numerator counts items shared by both sets, while the denominator counts distinct items present in either set. If both sets are empty, return 0.0. Otherwise return the similarity as a float.
Input: set_a = [1, 2, 3], set_b = [2, 3, 4]
Output: 0.500000
Explanation: The intersection has two items and the union has four, giving 2 / 4 = 0.5.
Input: set_a = [1, 2], set_b = [3, 4]
Output: 0.000000
Convert both lists to sets before measuring overlap.
Handle an empty union before performing the division.
Accepts: array
Accepts: array