<commit_before>Recently I've been reading about [methods to examine data](http://infolab.stanford.edu/~ullman/mmds/ch3.pdf) for finding similar 'items' in sets. A measure frequently used in data mining for this purpose is called *Jaccard Index*.

The *Jaccard Index* is a statistic value often used to compare the similarity between *sets* for binary variables. It measures the size ratio of the intersection between the *sets* divided by the length of its union.

Jaccard(A, B) = $\frac{\|A \bigcap B\|}{\|A \bigcup B\|}$

For instance, if J(A,B) is the *Jaccard Index* between sets A and B and A = {1,2,3}, B = {2,3,4}, C = {4,5,6}, then:
<commit_msg>MathJax problem fixed?<commit_after>Recently I've been reading about [methods to examine data](http://infolab.stanford.edu/~ullman/mmds/ch3.pdf) for finding similar 'items' in sets. A measure frequently used in data mining for this purpose is called *Jaccard Index*.

The *Jaccard Index* is a statistic value often used to compare the similarity between *sets* for binary variables. It measures the size ratio of the intersection between the *sets* divided by the length of its union.

Jaccard(A, B) = $$\frac{\|A \bigcap B\|}{\|A \bigcup B\|}$$

For instance, if J(A,B) is the *Jaccard Index* between sets A and B and A = {1,2,3}, B = {2,3,4}, C = {4,5,6}, then:

{'fraction_non_alphanumeric': 0.12072892938496584, 'fraction_numerical': 0.015186028853454821, 'mean_word_length': 4.468879668049793, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '3515686', 'n_tokens_mistral': 425, 'n_tokens_neox': 409, 'n_words': 188}