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

Algorithm 2

Seed community selection algorithm.

Input : Graph G = (V, E)

Output : Seed community set Seeds

1: Seeds = ∅;

2: for each i ∈ Vdo

3:  if node i has been accessed then

4:   continue;

5:  else

6:   mark node i as visited;

7:  end if

8:  max ← the SCS value of node i is calculated;

9:  while true do

10:   value ← SCS values of all neighbor nodes of node i are calculated, and all

  neighbor nodes are marked as visited. The node with the maximum SCS value is

  selected. If the node with the maximum SCS value is not unique, a node j with the

  maximum SCS value is randomly selected;

11:   ifmax >= valuethen

12:    Seeds ← the subgraph formed by node i and its neighbor nodes serves as a seed

   community;

13:    break;

14:   else

15:    max = value;

16:    i = j;

17:   end if

18:   end while

19: end for