up:: Jaccard Similarity, Cosine Similarity
Given an undirected Simple Graph with Adjacency Matrix and nodes , then their Jaccard similarity is
Their cosine similarity is
Multiplying and dividing by 1, we have
since
with .
We need to consider two cases:
- , in which case we simply have
- without loss of generality, for which we have
Since
we have that as defined above.
Thus, we conclude that
That is, the Jaccard similarity of two nodes is more stringent than their cosine similarity.
Footnotes
-
Assuming both have degree greater than . ↩