VertexCosineSimilarity
VertexCosineSimilarity[g,u,v]
gives the cosine similarity between vertices u and v of the graph g.
VertexCosineSimilarity[{vw,…},…]
uses rules vw to specify the graph g.
Details
- The vertex cosine similarity is also known as Salton similarity.
- The vertex cosine similarity is the number of common neighbors of u and v divided by the geometric mean of their degrees.
- VertexCosineSimilarity works with undirected graphs, directed graphs, weighted graphs, multigraphs, and mixed graphs.
Examples
open allclose allScope (7)
VertexCosineSimilarity works with undirected graphs:
Use rules to specify the graph:
VertexCosineSimilarity works with large graphs:
Properties & Relations (3)
Use CosineDistance to compute the cosine similarity of a graph:
The cosine similarity between two vertices is equal to zero if one of the vertices has degree zero:
The cosine similarity between two vertices is equal to one if they have the same neighbors:
Text
Wolfram Research (2012), VertexCosineSimilarity, Wolfram Language function, https://reference.wolfram.com/language/ref/VertexCosineSimilarity.html (updated 2015).
CMS
Wolfram Language. 2012. "VertexCosineSimilarity." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/VertexCosineSimilarity.html.
APA
Wolfram Language. (2012). VertexCosineSimilarity. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/VertexCosineSimilarity.html