This chapter provides explanations and examples for each of the similarity algorithms in the Neo4j Labs Graph Algorithms library.

This is documentation for the Graph Algorithms Library, which has been deprecated by the Graph Data Science Library (GDS). |

These algorithms help calculate the similarity of nodes:

- Jaccard Similarity (
`algo.similarity.jaccard`

) - Cosine Similarity (
`algo.similarity.cosine`

) - Pearson Similarity (
`algo.similarity.pearson`

) - Euclidean Distance (
`algo.similarity.euclidean`

) - Overlap Similarity (
`algo.similarity.overlap`

) - Approximate Nearest Neighbors (
`algo.ml.ann`

)