gives the Jaccard similarity between vertices u and v of the graph g.
uses rules vw to specify the graph g.
- The vertex Jaccard similarity is also known as Jaccard index and Jaccard similarity coefficient.
- The vertex Jaccard similarity between u and v is the number of common neighbors of u and v divided by the number of vertices that are neighbors of u or v.
- VertexJaccardSimilarity works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Examplesopen allclose all
Introduced in 2012
(9.0)| Updated in 2015