# How to find similarity between two graphs in Neo4j?

**URL:** https://community.neo4j.com/t/how-to-find-similarity-between-two-graphs-in-neo4j/12387
**Category:** Graph Data Science / Graph Analytics
**Created:** [December 1, 2019, 3:06pm UTC](https://community.neo4j.com/t/how-to-find-similarity-between-two-graphs-in-neo4j/12387 "2019-12-01T15:06:26Z")
**Posts on this page:** 1
**Showing post:** 8

<div class="post-metadata">

### Author: ![shan](https://sea1.discourse-cdn.com/flex021/user_avatar/community.neo4j.com/shan/32/7767_2.png) [@shan](https://community.neo4j.com/u/shan)
#### Post date: [December 4, 2019, 4:01pm UTC](https://community.neo4j.com/t/how-to-find-similarity-between-two-graphs-in-neo4j/12387/8 "2019-12-04T16:01:31Z")

</div>

A new graph algorithm was released yesterday that might help you with your usecase:

> **[Node Similarity - Neo4j Graph Data Science](https://neo4j.com/docs/graph-data-science/1.1/algorithms/node-similarity/)**
>
> This section describes the Node Similarity algorithm in the Neo4j Graph Data Science library.

> The Node Similarity algorithm compares a set of nodes based on the nodes they are connected to. Two nodes are considered similar if they share many of the same neighbors. Node Similarity computes pair-wise similarities based on the Jaccard metric.

---

_[View the full topic](https://community.neo4j.com/t/how-to-find-similarity-between-two-graphs-in-neo4j/12387)._