gives the Dice similarity between vertices u and v of the graph g.
uses rules vw to specify the graph g.
- VertexDiceSimilarity is also known as the Sørensen–Dice index or the Dice coefficient.
- The vertex Dice similarity is the number of common neighbors of u and v divided by half the sum of the degrees of u and v.
- VertexDiceSimilarity works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Examplesopen allclose all
Properties & Relations (3)
Use DiceDissimilarity to compute the Dice similarity of a graph:
Wolfram Research (2012), VertexDiceSimilarity, Wolfram Language function, https://reference.wolfram.com/language/ref/VertexDiceSimilarity.html (updated 2015).
Wolfram Language. 2012. "VertexDiceSimilarity." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/VertexDiceSimilarity.html.
Wolfram Language. (2012). VertexDiceSimilarity. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/VertexDiceSimilarity.html