liveBook · Manning

Jaccard similarity

Also called Jaccard index

Jaccard similarity is a measure of overlap between two sets, calculated as the size of their intersection divided by the size of their union.

How 3 Manning books explain it

Graph Algorithms for Data Science

The Jaccard similarity coefficient is the ratio of the intersection size to the union size of two sets, measuring their member overlap from 0 to 1.

How it is used
Infers weighted co-occurrence relationships from shared neighbors when projecting bipartite networks into monopartite networks.
How deep it goes
Defines the intersection-over-union score, works through baskets, and configures GDS node similarity without deriving algorithm internals.
Examples
Uses overlapping product baskets, tweets and hashtags, and users linked to musical genres.
What you can do after
Apply it via the GDS node similarity algorithm to inspect, threshold, and create scored co-occurrence relationships.

Read how Graph Algorithms for Data Science explains Jaccard similarity →

Build AI Drug Discovery Pipelines

Tanimoto similarity is a metric that compares two sets or binary molecular fingerprints as the ratio of shared features to their union.

How it is used
Deploys molecular fingerprints to rank compounds for ligand-based similarity searching and screening.
How deep it goes
Defines the set ratio, contrasts Dice, demonstrates query scoring, and stops short of deeper fingerprint theory.
Examples
Uses Malaria Box compounds, a single query molecule, score extremes, thresholded matches, and saved top hits.
What you can do after
Apply it via fingerprint utilities to compute query-library scores, filter hits, and save top similar compounds.

Read how Build AI Drug Discovery Pipelines explains Jaccard similarity →

Quantization and Fast Inference

Jaccard similarity is the size of the intersection of two sets divided by the size of their union.

How it is used
Compares overlap between top-magnitude activation channels in consecutive transformer layers.
How deep it goes
Defines the intersection-over-union measure and applies it to adjacent layers, without deriving it further.
Examples
Contrasts consecutive-layer similarities of 0.70 for OPT-6.7B and 0.54 for OPT-125M.
What you can do after
Evaluate whether high-magnitude channels recur across adjacent layers using set overlap.

Read how Quantization and Fast Inference explains Jaccard similarity →

Also covered in

What to know first

Related concepts

Questions about Jaccard similarity

What is Jaccard similarity?

Jaccard similarity is a measure of overlap between two sets, calculated as the size of their intersection divided by the size of their union.

Which Manning books explain Jaccard similarity?

Graph Algorithms for Data Science, Build AI Drug Discovery Pipelines and Quantization and Fast Inference.

What should I know before learning Jaccard similarity?

Manning books that teach Jaccard similarity usually introduce embedding first.

What is the difference between Jaccard similarity and Dice similarity coefficient?

Jaccard similarity is a measure of overlap between two sets, calculated as the size of their intersection divided by the size of their union. The Dice similarity coefficient measures the overlap between two sets as twice their intersection size divided by the sum of their sizes.

What is Jaccard similarity a kind of?

Jaccard similarity is a kind of similarity. A numerical or geometric measure of how closely two represented entities resemble one another.

What is Jaccard similarity also called?

Jaccard similarity is also called Jaccard index.

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.