Overlapping Community Detection Algorithm Based on High-Quality Subgraph Extension in Local Core Regions of Network

Algorithm 3

Seed community expansion algorithm.

Input : Graph G = (V, E), Seed community set Seeds

Output : Overlapping community set C

1: C = ∅;

2: for each s ∈ Seedsdo

3:  C_s = s;

4:  While true do

5:   select any neighbor node i of the seed community C_s;

6:   ifI(i) > 0 and E(i) < 0 then

7:    C_s = C_s ∪ i;

8:   end if

9:   if all neighbor nodes of seed community C_s do not satisfy I > 0 and E < 0 then

10:    break;

11:   end if

12:  end while

13:  C = C ∪ C_s;

14: end for