hVSrSSKJr SSKrSSKJr /SQrSSjr\"S5\"S5\RSS j555r \"S5\"S5\RSS j555r \"S5\"S5\RSS j555r \"S5\"S5\RSS j555r \"S5\"S5\RSS j555r\"S5\"S5\R"SS9SSj555r\"S5\"S5\R"SS9SSj555r\"S5\"S5\R"SS9SSj555rSrg)z Link prediction algorithms. )logN)not_implemented_for)resource_allocation_indexjaccard_coefficientadamic_adar_indexpreferential_attachmentcn_soundarajan_hopcroftra_index_soundarajan_hopcroftwithin_inter_clustercommon_neighbor_centralityc^Uc[R"U5nOIUHCup4X0;a[R"SUS35eX@;dM+[R"SUS35e U4SjU5$)aApplies the given function to each edge in the specified iterable of edges. `G` is an instance of :class:`networkx.Graph`. `func` is a function on two inputs, each of which is a node in the graph. The function can return anything, but it should return a value representing a prediction of the likelihood of a "link" joining the two nodes. `ebunch` is an iterable of pairs of nodes. If not specified, all non-edges in the graph `G` will be used. zNode z not in G.c3<># UHupXT"X54v M g7fN).0uvfuncs U/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/link_prediction.py $_apply_prediction..-s 2641Q4: 6s)nx non_edges NodeNotFound)Grebunchrrs ` r_apply_predictionrsj~aDAzooaS &;<<zooaS &;<<  36 22directed multigraphc(^U4Sjn[TX!5$)amCompute the resource allocation index of all node pairs in ebunch. Resource allocation index of `u` and `v` is defined as .. math:: \sum_{w \in \Gamma(u) \cap \Gamma(v)} \frac{1}{|\Gamma(w)|} where $\Gamma(u)$ denotes the set of neighbors of $u$. Parameters ---------- G : graph A NetworkX undirected graph. ebunch : iterable of node pairs, optional (default = None) Resource allocation index will be computed for each pair of nodes given in the iterable. The pairs must be given as 2-tuples (u, v) where u and v are nodes in the graph. If ebunch is None then all nonexistent edges in the graph will be used. Default value: None. Returns ------- piter : iterator An iterator of 3-tuples in the form (u, v, p) where (u, v) is a pair of nodes and p is their resource allocation index. Raises ------ NetworkXNotImplemented If `G` is a `DiGraph`, a `Multigraph` or a `MultiDiGraph`. NodeNotFound If `ebunch` has a node that is not in `G`. Examples -------- >>> G = nx.complete_graph(5) >>> preds = nx.resource_allocation_index(G, [(0, 1), (2, 3)]) >>> for u, v, p in preds: ... print(f"({u}, {v}) -> {p:.8f}") (0, 1) -> 0.75000000 (2, 3) -> 0.75000000 References ---------- .. [1] T. Zhou, L. Lu, Y.-C. Zhang. Predicting missing links via local information. Eur. Phys. J. B 71 (2009) 623. https://arxiv.org/pdf/0901.0553.pdf cX>[U4Sj[R"TX555$)Nc3L># UHnSTRU5- v M g7fNdegreerwrs rr=resource_allocation_index..predict..jsI,Hq1qxx{?,Hs!$sumrcommon_neighborsrrrs rpredict*resource_allocation_index..predictis!IB,?,?1,HIIIrrrrr/s` rrr0srJ Q 00rc(^U4Sjn[TX!5$)aYCompute the Jaccard coefficient of all node pairs in ebunch. Jaccard coefficient of nodes `u` and `v` is defined as .. math:: \frac{|\Gamma(u) \cap \Gamma(v)|}{|\Gamma(u) \cup \Gamma(v)|} where $\Gamma(u)$ denotes the set of neighbors of $u$. Parameters ---------- G : graph A NetworkX undirected graph. ebunch : iterable of node pairs, optional (default = None) Jaccard coefficient will be computed for each pair of nodes given in the iterable. The pairs must be given as 2-tuples (u, v) where u and v are nodes in the graph. If ebunch is None then all nonexistent edges in the graph will be used. Default value: None. Returns ------- piter : iterator An iterator of 3-tuples in the form (u, v, p) where (u, v) is a pair of nodes and p is their Jaccard coefficient. Raises ------ NetworkXNotImplemented If `G` is a `DiGraph`, a `Multigraph` or a `MultiDiGraph`. NodeNotFound If `ebunch` has a node that is not in `G`. Examples -------- >>> G = nx.complete_graph(5) >>> preds = nx.jaccard_coefficient(G, [(0, 1), (2, 3)]) >>> for u, v, p in preds: ... print(f"({u}, {v}) -> {p:.8f}") (0, 1) -> 0.60000000 (2, 3) -> 0.60000000 References ---------- .. [1] D. Liben-Nowell, J. Kleinberg. The Link Prediction Problem for Social Networks (2004). http://www.cs.cornell.edu/home/kleinber/link-pred.pdf c>[[TU5[TU5-5nUS:Xag[[R"TX55U- $Nr)lensetrr-)rr union_sizers rr/$jaccard_coefficient..predictsIQqTS1Y./ ?2&&q!/0:==rr1r2s` rrrosp> Q 00rc(^U4Sjn[TX!5$)aCompute the Adamic-Adar index of all node pairs in ebunch. Adamic-Adar index of `u` and `v` is defined as .. math:: \sum_{w \in \Gamma(u) \cap \Gamma(v)} \frac{1}{\log |\Gamma(w)|} where $\Gamma(u)$ denotes the set of neighbors of $u$. This index leads to zero-division for nodes only connected via self-loops. It is intended to be used when no self-loops are present. Parameters ---------- G : graph NetworkX undirected graph. ebunch : iterable of node pairs, optional (default = None) Adamic-Adar index will be computed for each pair of nodes given in the iterable. The pairs must be given as 2-tuples (u, v) where u and v are nodes in the graph. If ebunch is None then all nonexistent edges in the graph will be used. Default value: None. Returns ------- piter : iterator An iterator of 3-tuples in the form (u, v, p) where (u, v) is a pair of nodes and p is their Adamic-Adar index. Raises ------ NetworkXNotImplemented If `G` is a `DiGraph`, a `Multigraph` or a `MultiDiGraph`. NodeNotFound If `ebunch` has a node that is not in `G`. Examples -------- >>> G = nx.complete_graph(5) >>> preds = nx.adamic_adar_index(G, [(0, 1), (2, 3)]) >>> for u, v, p in preds: ... print(f"({u}, {v}) -> {p:.8f}") (0, 1) -> 2.16404256 (2, 3) -> 2.16404256 References ---------- .. [1] D. Liben-Nowell, J. Kleinberg. The Link Prediction Problem for Social Networks (2004). http://www.cs.cornell.edu/home/kleinber/link-pred.pdf cX>[U4Sj[R"TX555$)Nc3^># UH"nS[TRU55- v M$ g7fr$)rr'r(s rr5adamic_adar_index..predict..s%N1MA1s188A;''1Ms*-r+r.s rr/"adamic_adar_index..predicts!N1D1DQ1MNNNrr1r2s` rrrstO Q 00rc^^^^TS:XaU4SjnO3[[R"T55m[S5mUUUU4Sjn[ TX15$)a Return the CCPA score for each pair of nodes. Compute the Common Neighbor and Centrality based Parameterized Algorithm(CCPA) score of all node pairs in ebunch. CCPA score of `u` and `v` is defined as .. math:: \alpha \cdot (|\Gamma (u){\cap }^{}\Gamma (v)|)+(1-\alpha )\cdot \frac{N}{{d}_{uv}} where $\Gamma(u)$ denotes the set of neighbors of $u$, $\Gamma(v)$ denotes the set of neighbors of $v$, $\alpha$ is parameter varies between [0,1], $N$ denotes total number of nodes in the Graph and ${d}_{uv}$ denotes shortest distance between $u$ and $v$. This algorithm is based on two vital properties of nodes, namely the number of common neighbors and their centrality. Common neighbor refers to the common nodes between two nodes. Centrality refers to the prestige that a node enjoys in a network. .. seealso:: :func:`common_neighbors` Parameters ---------- G : graph NetworkX undirected graph. ebunch : iterable of node pairs, optional (default = None) Preferential attachment score will be computed for each pair of nodes given in the iterable. The pairs must be given as 2-tuples (u, v) where u and v are nodes in the graph. If ebunch is None then all nonexistent edges in the graph will be used. Default value: None. alpha : Parameter defined for participation of Common Neighbor and Centrality Algorithm share. Values for alpha should normally be between 0 and 1. Default value set to 0.8 because author found better performance at 0.8 for all the dataset. Default value: 0.8 Returns ------- piter : iterator An iterator of 3-tuples in the form (u, v, p) where (u, v) is a pair of nodes and p is their Common Neighbor and Centrality based Parameterized Algorithm(CCPA) score. Raises ------ NetworkXNotImplemented If `G` is a `DiGraph`, a `Multigraph` or a `MultiDiGraph`. NetworkXAlgorithmError If self loops exist in `ebunch` or in `G` (if `ebunch` is `None`). NodeNotFound If `ebunch` has a node that is not in `G`. Examples -------- >>> G = nx.complete_graph(5) >>> preds = nx.common_neighbor_centrality(G, [(0, 1), (2, 3)]) >>> for u, v, p in preds: ... print(f"({u}, {v}) -> {p}") (0, 1) -> 3.4000000000000004 (2, 3) -> 3.4000000000000004 References ---------- .. [1] Ahmad, I., Akhtar, M.U., Noor, S. et al. Missing Link Prediction using Common Neighbor and Centrality based Parameterized Algorithm. Sci Rep 10, 364 (2020). https://doi.org/10.1038/s41598-019-57304-y r%cz>X:Xa[R"S5e[[R"TX55$)NSelf loops are not supported)rNetworkXAlgorithmErrorr6r-r.s rr/+common_neighbor_centrality..predictGs2v//0NOOr**1a34 4rinfc>X:Xa[R"S5eTURUT5n[[R"TX55nTU-ST- [T5-U- -$)NrAr%)rrBgetr6r-)rrpath_lenn_nbrsralpharDspls rr/rCQsfv//0NOO1vzz!S)H,,Q56F6>QY#a&$88$CC Cr)dictrshortest_path_lengthfloatr)rrrIr/rDrJs` ` @@rr r sMj z 52**1-.El D D Q 00rc(^U4Sjn[TX!5$)aCCompute the preferential attachment score of all node pairs in ebunch. Preferential attachment score of `u` and `v` is defined as .. math:: |\Gamma(u)| |\Gamma(v)| where $\Gamma(u)$ denotes the set of neighbors of $u$. Parameters ---------- G : graph NetworkX undirected graph. ebunch : iterable of node pairs, optional (default = None) Preferential attachment score will be computed for each pair of nodes given in the iterable. The pairs must be given as 2-tuples (u, v) where u and v are nodes in the graph. If ebunch is None then all nonexistent edges in the graph will be used. Default value: None. Returns ------- piter : iterator An iterator of 3-tuples in the form (u, v, p) where (u, v) is a pair of nodes and p is their preferential attachment score. Raises ------ NetworkXNotImplemented If `G` is a `DiGraph`, a `Multigraph` or a `MultiDiGraph`. NodeNotFound If `ebunch` has a node that is not in `G`. Examples -------- >>> G = nx.complete_graph(5) >>> preds = nx.preferential_attachment(G, [(0, 1), (2, 3)]) >>> for u, v, p in preds: ... print(f"({u}, {v}) -> {p}") (0, 1) -> 16 (2, 3) -> 16 References ---------- .. [1] D. Liben-Nowell, J. Kleinberg. The Link Prediction Problem for Social Networks (2004). http://www.cs.cornell.edu/home/kleinber/link-pred.pdf cJ>TRU5TRU5-$rr&r.s rr/(preferential_attachment..predictsxx{QXXa[((rr1r2s` rrr\sp) Q 00r community) node_attrsc,^^UU4Sjn[TX15$)aCount the number of common neighbors of all node pairs in ebunch using community information. For two nodes $u$ and $v$, this function computes the number of common neighbors and bonus one for each common neighbor belonging to the same community as $u$ and $v$. Mathematically, .. math:: |\Gamma(u) \cap \Gamma(v)| + \sum_{w \in \Gamma(u) \cap \Gamma(v)} f(w) where $f(w)$ equals 1 if $w$ belongs to the same community as $u$ and $v$ or 0 otherwise and $\Gamma(u)$ denotes the set of neighbors of $u$. Parameters ---------- G : graph A NetworkX undirected graph. ebunch : iterable of node pairs, optional (default = None) The score will be computed for each pair of nodes given in the iterable. The pairs must be given as 2-tuples (u, v) where u and v are nodes in the graph. If ebunch is None then all nonexistent edges in the graph will be used. Default value: None. community : string, optional (default = 'community') Nodes attribute name containing the community information. G[u][community] identifies which community u belongs to. Each node belongs to at most one community. Default value: 'community'. Returns ------- piter : iterator An iterator of 3-tuples in the form (u, v, p) where (u, v) is a pair of nodes and p is their score. Raises ------ NetworkXNotImplemented If `G` is a `DiGraph`, a `Multigraph` or a `MultiDiGraph`. NetworkXAlgorithmError If no community information is available for a node in `ebunch` or in `G` (if `ebunch` is `None`). NodeNotFound If `ebunch` has a node that is not in `G`. Examples -------- >>> G = nx.path_graph(3) >>> G.nodes[0]["community"] = 0 >>> G.nodes[1]["community"] = 0 >>> G.nodes[2]["community"] = 0 >>> preds = nx.cn_soundarajan_hopcroft(G, [(0, 2)]) >>> for u, v, p in preds: ... print(f"({u}, {v}) -> {p}") (0, 2) -> 2 References ---------- .. [1] Sucheta Soundarajan and John Hopcroft. Using community information to improve the precision of link prediction methods. In Proceedings of the 21st international conference companion on World Wide Web (WWW '12 Companion). ACM, New York, NY, USA, 607-608. http://doi.acm.org/10.1145/2187980.2188150 c>^[TUT5m[TUT5n[R"TX5nTU:Xa[UUU4SjU55OSn[ U5U-$)Nc3D># UHn[TUT5T:Hv M g7fr) _communityrr)CurrQs rr;cn_soundarajan_hopcroft..predict..sB6a 1a+r16s r)rVrr-r,r6)rrCvcnbors neighborsrXrrQs @rr/(cn_soundarajan_hopcroft..predicts^ 1i ( 1i ($$Q-FHBhCB6B BTU 6{Y&&rr1rrrQr/s` ` rr r sT' Q 00rc,^^UU4Sjn[TX15$)aCompute the resource allocation index of all node pairs in ebunch using community information. For two nodes $u$ and $v$, this function computes the resource allocation index considering only common neighbors belonging to the same community as $u$ and $v$. Mathematically, .. math:: \sum_{w \in \Gamma(u) \cap \Gamma(v)} \frac{f(w)}{|\Gamma(w)|} where $f(w)$ equals 1 if $w$ belongs to the same community as $u$ and $v$ or 0 otherwise and $\Gamma(u)$ denotes the set of neighbors of $u$. Parameters ---------- G : graph A NetworkX undirected graph. ebunch : iterable of node pairs, optional (default = None) The score will be computed for each pair of nodes given in the iterable. The pairs must be given as 2-tuples (u, v) where u and v are nodes in the graph. If ebunch is None then all nonexistent edges in the graph will be used. Default value: None. community : string, optional (default = 'community') Nodes attribute name containing the community information. G[u][community] identifies which community u belongs to. Each node belongs to at most one community. Default value: 'community'. Returns ------- piter : iterator An iterator of 3-tuples in the form (u, v, p) where (u, v) is a pair of nodes and p is their score. Raises ------ NetworkXNotImplemented If `G` is a `DiGraph`, a `Multigraph` or a `MultiDiGraph`. NetworkXAlgorithmError If no community information is available for a node in `ebunch` or in `G` (if `ebunch` is `None`). NodeNotFound If `ebunch` has a node that is not in `G`. Examples -------- >>> G = nx.Graph() >>> G.add_edges_from([(0, 1), (0, 2), (1, 3), (2, 3)]) >>> G.nodes[0]["community"] = 0 >>> G.nodes[1]["community"] = 0 >>> G.nodes[2]["community"] = 1 >>> G.nodes[3]["community"] = 0 >>> preds = nx.ra_index_soundarajan_hopcroft(G, [(0, 3)]) >>> for u, v, p in preds: ... print(f"({u}, {v}) -> {p:.8f}") (0, 3) -> 0.50000000 References ---------- .. [1] Sucheta Soundarajan and John Hopcroft. Using community information to improve the precision of link prediction methods. In Proceedings of the 21st international conference companion on World Wide Web (WWW '12 Companion). ACM, New York, NY, USA, 607-608. http://doi.acm.org/10.1145/2187980.2188150 c>^[TUT5m[TUT5nTU:wag[R"TX5n[UUU4SjU55$)Nrc3r># UH,n[TUT5T:XdMSTRU5- v M. g7fr$)rVr'rWs rrAra_index_soundarajan_hopcroft..predict..Bs0XFqjAy6QUW6W?1qxx{?Fs77)rVrr-r,)rrrZr[rXrrQs @rr/.ra_index_soundarajan_hopcroft..predict<sL 1i ( 1i ( 8$$Q-XFXXXrr1r^s` ` rr r sXY Q 00rch^^^TS::a[R"S5eUUU4Sjn[TXA5$)a[ Compute the ratio of within- and inter-cluster common neighbors of all node pairs in ebunch. For two nodes `u` and `v`, if a common neighbor `w` belongs to the same community as them, `w` is considered as within-cluster common neighbor of `u` and `v`. Otherwise, it is considered as inter-cluster common neighbor of `u` and `v`. The ratio between the size of the set of within- and inter-cluster common neighbors is defined as the WIC measure. [1]_ Parameters ---------- G : graph A NetworkX undirected graph. ebunch : iterable of node pairs, optional (default = None) The WIC measure will be computed for each pair of nodes given in the iterable. The pairs must be given as 2-tuples (u, v) where u and v are nodes in the graph. If ebunch is None then all nonexistent edges in the graph will be used. Default value: None. delta : float, optional (default = 0.001) Value to prevent division by zero in case there is no inter-cluster common neighbor between two nodes. See [1]_ for details. Default value: 0.001. community : string, optional (default = 'community') Nodes attribute name containing the community information. G[u][community] identifies which community u belongs to. Each node belongs to at most one community. Default value: 'community'. Returns ------- piter : iterator An iterator of 3-tuples in the form (u, v, p) where (u, v) is a pair of nodes and p is their WIC measure. Raises ------ NetworkXNotImplemented If `G` is a `DiGraph`, a `Multigraph` or a `MultiDiGraph`. NetworkXAlgorithmError - If `delta` is less than or equal to zero. - If no community information is available for a node in `ebunch` or in `G` (if `ebunch` is `None`). NodeNotFound If `ebunch` has a node that is not in `G`. Examples -------- >>> G = nx.Graph() >>> G.add_edges_from([(0, 1), (0, 2), (0, 3), (1, 4), (2, 4), (3, 4)]) >>> G.nodes[0]["community"] = 0 >>> G.nodes[1]["community"] = 1 >>> G.nodes[2]["community"] = 0 >>> G.nodes[3]["community"] = 0 >>> G.nodes[4]["community"] = 0 >>> preds = nx.within_inter_cluster(G, [(0, 4)]) >>> for u, v, p in preds: ... print(f"({u}, {v}) -> {p:.8f}") (0, 4) -> 1.99800200 >>> preds = nx.within_inter_cluster(G, [(0, 4)], delta=0.5) >>> for u, v, p in preds: ... print(f"({u}, {v}) -> {p:.8f}") (0, 4) -> 1.33333333 References ---------- .. [1] Jorge Carlos Valverde-Rebaza and Alneu de Andrade Lopes. Link prediction in complex networks based on cluster information. In Proceedings of the 21st Brazilian conference on Advances in Artificial Intelligence (SBIA'12) https://doi.org/10.1007/978-3-642-34459-6_10 rzDelta must be greater than zeroc>[TUT 5n[TUT 5nX#:wag[R"TX5nUVs1sHn[TUT 5U:XdMUiM nnXF- n[U5[U5T -- $s snfr5)rVrr-r6) rrrXrZr[r)withininterrrQdeltas rr/%within_inter_cluster..predicts 1i ( 1i ( 8$$Q-#IVz!Q 'Bb'H!VI6{c%j5011Js A<A<)rrBr)rrrhrQr/s` `` rr r Gs3` z''(IJJ2 Q 00rcURUnX2$![an[R"SU35UeSnAff=f)z$Get the community of the given node.z,No community information available for Node N)nodesKeyErrorrrB)rrrQnode_uerrs rrVrVsM WWQZF  '':1# >  s >9>r)Ng?)NrQ)NgMbP?rQ)__doc__mathrnetworkxrnetworkx.utilsr__all__r _dispatchablerrrr rr r r rVrrrrus. 34Z \"91#!91xZ \";1#!;1|Z \":1#!:1zZ \"f1#!f1RZ \"81#!81vZ \"[)P1*#!P1fZ \"[)Q1*#!Q1hZ \"[)Z1*#!Z1zr