A Parallel Community Structure Mining Method in Big Social Networks

Algorithm 3

The map procedure of community detection on a subnetwork .

   (1) Initialization-global variables

   (2)   //number of communities

   (3)  

   (4)  for   from to , do

   (5)    //community ID of

   (6)   

   (7)  endfor

   (8) method Map(node ,)

   (9) while  , do

 (10)  for  , do

  (11)    //able to merge in current iteration

 (12)  endfor

 (13)  for  , do

 (14)    //randomly select a node(community)

 (15)   

 (16)    //decrease of

 (17)    //community id which leads to minimum

 (18)   for   in , do

 (19)     if   //if merge and

 (20)        

 (21)        

(22)     endif

(23)   endfor

(24)   if   0 & δ , then

(25)    

(26)    

(27)    

(28)    

(29)   endif

(30)  endfor

(31) endwhile

(32) for  , do

(33)  

(34) endfor