Hello everyone,
I was just wondering if someone could tell me about a documentation page that I couldn't find anymore.
It's the Jaccard similarity algorithm implemented in graph data science that is not available anymore. Is it because the page's being updated, and will be ready later ?
(https://neo4j.com/docs/graph-data-science/1.1/labs-algorithms/jaccard/)
Thanks a lot,
Leila
The link for the 1.1 version of Jaccard is: Jaccard Similarity - Neo4j Graph Data Science
We're currently on our 2.0 release (!) though, so you might want to look for more recent implementations here: Similarity - Neo4j Graph Data Science
ameyasoft
( Ameyasoft)
April 1, 2022, 6:36pm
3
Check this link where I answered the Jaccard similarity algorithm.
Hi Doug,
Thanks for your detailed reply. Regarding your questions on count1, coun12, intersection here is some info.
In the Jaccard similarity code item1 and item2 refer to Entity1 and Entity2 .
Count1 gives the total number of Processes associated with a given Entity. Example: Entity " Adjudication Outcome Option" has access to 20 Processes.
Count2 is same as Count1 except for the second Entity.
Intersection is the Processes that are shared between two Entities. In the second picture abov…