Research Article
SiFSO: Fish Swarm Optimization-Based Technique for Efficient Community Detection in Complex Networks
Algorithm 1
Sigmoid Fish Swarm Optimization (SiFSO) algorithm.
Fish movement: | | Input: Visual Range, Visual Decrease, Minimum Visual Range, Pixels Iteration Number, Step, Step Decrease, Minimum Step, Try Number, Factor, Fish coordinates | Output: Each solution corresponds to a partition of a network. | (1) | Begin Algorithm | (2) | Min–Max Normalization | (3) | Label Propagation Initialization | (4) | for iterations ⟵ 1 to iteration number do | (5) | for FishNo ⟵ 1 to total Fish do | (6) | current Fish neighbors ⟵ 0 | (7) | current Fish neighbors ⟵ Fish in visual range | (8) | if neighbors = 0 | (9) | next move ⟵ Sigmoid (Free Move) | (10) | Break, go to step-1 | (11) | else | (12) | If density > crowed factor and better food consistency | (13) | Next move ⟵ Sigmoid (Prey Move) | (14) | else | (15) | Next Move ⟵ Random (Sigmoid (Swarm Move or Follow Move)) | (16) | end | (17) | end | (18) | final result ⟶ apply modularity | (19) | End Algorithm |
|