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 all close allScope (6)
VertexJaccardSimilarity works with undirected graphs:
Use rules to specify the graph:
VertexJaccardSimilarity works with large graphs:
Properties & Relations (3)
Use JaccardDissimilarity to compute the Jaccard similarity of a graph:
The Jaccard similarity between two vertices is equal to zero if one of them has degree zero:
The Jaccard similarity between two vertices is equal to 1 if they have the same neighbors:
Text
Wolfram Research (2012), VertexJaccardSimilarity, Wolfram Language function, https://reference.wolfram.com/language/ref/VertexJaccardSimilarity.html (updated 2015).
CMS
Wolfram Language. 2012. "VertexJaccardSimilarity." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/VertexJaccardSimilarity.html.
APA
Wolfram Language. (2012). VertexJaccardSimilarity. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/VertexJaccardSimilarity.html