VertexJaccardSimilarity

VertexJaccardSimilarity[g,u,v]

gives the Jaccard similarity between vertices u and v of the graph g.

VertexJaccardSimilarity[{vw,},]

uses rules vw to specify the graph g.

Details

  • 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.

Examples

open allclose all

Basic Examples  (1)

Jaccard similarity between two vertices in a graph:

In[1]:=
Click for copyable input
Out[1]=

Scope  (6)

Properties & Relations  (3)

See Also

VertexCorrelationSimilarity  VertexDiceSimilarity  VertexCosineSimilarity

Introduced in 2012
(9.0)
| Updated in 2015
(10.3)