Research Article
A Local Extended Algorithm Combined with Degree and Clustering Coefficient to Optimize Overlapping Community Detection
Algorithm 1
Node importance evaluation algorithm.
| Input: a network G(V, E), the number of nodes in the network n | | Output: the importance of each node | (1) | Initialize D = , CC = | (2) | for i in n do | (3) | Calculate D(i) using formula (4) during D decomposition | (4) | end for | (5) | for i in n do | (6) | Calculate CC(i) using formula (5) | (7) | end for | (8) | Create matrix R using formula (6) | (9) | for i in 2 do | (10) | Calculate using formula (7) | (11) | end for | (12) | for i in n do | (13) | Calculate CLC(i) using formula (10) | (14) | end for |
|