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

Algorithm 1

The OLCRE algorithm.

Input : Graph G = (V, E)

Output : Overlapping community structure

1: C = ∅;

2: According to seed community selection algorithm (Algorithm 2), seed community

  set, denoted by , are selected from network G;

3: Select any seed community, denoted by , and go to Step 4 if Seeds ≠ ∅. Otherwise,

  go to Step 5;

4: Remove from Seeds, and then expand it into a community structure C_s according to

  the seed community extension algorithm (Algorithm 3), and add C_s to , returning to

  Step 3;

5: Simplify and re-detect overlapping nodes and possible missing nodes;

6: Output overlapping community structure C;