Research Article
Performance Evaluation of Modularity Based Community Detection Algorithms in Large Scale Networks
Algorithm 4
Fine-tuning implemented in this work.
Input: A network ; | Two communities and ; | A division vector (7); | Number of nodes to be moved | Output: Two communities and ; | A division vector (after moving nodes) | (1) ; | (2) ; | (3) ; | (4) ; | (5) while do | (6) if then | (7) Calculate ; | (8) ; | (9) end | (10) ; | (11) ; | (12) foreach element in vector do | (13) if element still not moved then | (14) Calculate if is moved from to (or from to ) with (15); | (15) if then | (16) ; | (17) ; | (18) end | (19) end | (20) end | (21) Update vector moving from to or from to ; | (22) ; | (23) Mark element as moved; | (24) if then | (25) ; | (26) ; | (27) end | (28) end |
|