Similarity

This version of Graph Data Science is EOL. You can find the most recent version here.

Similarity algorithms compute the similarity of pairs of nodes based on their neighborhoods or their properties. Several similarity metrics can be used to compute a similarity score. The Neo4j GDS library includes the following similarity algorithms:

Node Similarity
- Filtered Node Similarity
K-Nearest Neighbors
- Filtered K-Nearest Neighbors

As well as a collection of different similarity functions for calculating similarity between arrays of numbers