sklearn.metrics.jaccard_similarity_score

sklearn.metrics.jaccard_similarity_score(y_true, y_pred, normalize=True)

Jaccard similarity coefficient score

The Jaccard index [1], or Jaccard similarity coefficient, defined as the size of the intersection divided by the size of the union of two label sets, is used to compare set of predicted labels for a sample to the corresponding set of labels in y_true.

Parameters :

y_true : array-like or list of labels or label indicator matrix

Ground truth (correct) labels.

y_pred : array-like or list of labels or label indicator matrix

Predicted labels, as returned by a classifier.

normalize : bool, optional (default=True)

If False, return the sum of the Jaccard similarity coefficient over the sample set. Otherwise, return the average of Jaccard similarity coefficient.

Returns :

score : float

If normalize == True, return the average Jaccard similarity coefficient, else it returns the sum of the Jaccard similarity coefficient over the sample set.

The best performance is 1 with normalize == True and the number of samples with normalize == False.

See also

accuracy_score, hamming_loss, zero_one_loss

Notes

In binary and multiclass classification, this function is equivalent to the accuracy_score. It differs in the multilabel classification problem.

References

[R165]

Wikipedia entry for the Jaccard index

Examples

>>> import numpy as np
>>> from sklearn.metrics import jaccard_similarity_score
>>> y_pred = [0, 2, 1, 3]
>>> y_true = [0, 1, 2, 3]
>>> jaccard_similarity_score(y_true, y_pred)
0.5
>>> jaccard_similarity_score(y_true, y_pred, normalize=False)
2

In the multilabel case with binary indicator format:

>>> jaccard_similarity_score(np.array([[0.0, 1.0], [1.0, 1.0]]),        np.ones((2, 2)))
0.75

and with a list of labels format:

>>> jaccard_similarity_score([(1, ), (3, )], [(1, 2), tuple()])
0.25