Compute the Jaccard coefficient of all node pairs in ebunch.
Jaccard coefficient of nodes \(u\) and \(v\) is defined as
where \(\Gamma(u)\) denotes the set of neighbors of \(u\).
Parameters: | G : graph
ebunch : iterable of node pairs, optional (default = None)
|
---|---|
Returns: | piter : iterator
|
References
[R263] | D. Liben-Nowell, J. Kleinberg. The Link Prediction Problem for Social Networks (2004). http://www.cs.cornell.edu/home/kleinber/link-pred.pdf |
Examples
>>> import networkx as nx
>>> G = nx.complete_graph(5)
>>> preds = nx.jaccard_coefficient(G, [(0, 1), (2, 3)])
>>> for u, v, p in preds:
... '(%d, %d) -> %.8f' % (u, v, p)
...
'(0, 1) -> 0.60000000'
'(2, 3) -> 0.60000000'