Similarity Algorithms

Similarity algorithms assign a score to a pair of vertices based on how similar they are. This usually involves seeing if they have the same or similar neighborhoods. This section also includes distance algorithms, as distance is the inverse of similarity.

The TigerGraph Graph Data Science Library provides the following similarity algorithms:

Euclidean Distance
Overlap Similarity
Pearson Similarity
Cosine Similarity of Neighborhoods
- Cosine Similarity of Neighborhoods (All Pairs, Batch)
- Cosine Similarity of Neighborhoods (Single-Source)
Jaccard Similarity of Neighborhoods
- Jaccard Similarity of Neighborhoods (Batch)
- Jaccard Similarity of Neighborhoods (Single Source)