Research Article
Detecting Local Community Structures in Networks Based on Boundary Identification
| Local Community Detection Algorithm based on Boundary Identification | | Input: Network , and a given node | | Output: The local community that belongs to. | | (1) Initialize , ; | | (2) Calculate , ; | | (3) while true do | | (4) //Phase 1: agglomerate local community | | (5) for each do | | (6) Calculate by (4); | | (7) if | | (8) ; //merge into | | (9) Update , ; | | (10) else | | (11) ; //set to be a boundary node | | (12) end if | | (13) end for | | (14) //Phase 2: Identify the boundary of the local community | | (15) for do | | (16) ; // | | (17) ; //merge , into a module node | | (18) ; | | (19) if | | (20) ; //merge into | | (21) update , ; | | (22) end if | | (23) end for | | (24) end while | | (25) return |
|