Title: Novel objective-based coot puzzle optimisation for overlapping community expansion in complex networks

Authors: C.K. Suja; C.V.R. Harinarayanan; A. Arivalagan

Addresses: Department of Mathematics, Government Arts College, Paramakudi (Affiliated to Alagappa University), 623701, Tamil Nadu, India ' Department of Mathematics, Government Arts and Science College, Kappalur, Thirumangalam, Madurai-625008, Tamil Nadu, India ' PG and Research Department of Mathematics, Government Arts College, Paramakudi, 623701, Tamil Nadu, India

Abstract: Overlapping community detection receives more and more interest due to the possibility that certain nodes in real networks belong to numerous communities. However, the majority of the current overlapping community detection approaches significantly minimise the overfitting problems. This work proposes a novel approach for identifying influent nodes and overlapping community expansion in complex networks. Primarily, the identification of influential nodes is identified using the hybrid Renyi entropy and Mutual information (MI). Thereafter, in the overlapping community formation phase, the nodes other than the influential nodes are grouped to form an overlapping community. Finally, overlapping community expansion is accomplished utilising the proposed Coot Puzzle Optimisation Algorithm (CPOA). The proposed CPOA is the incorporation of the Puzzle Optimisation Algorithm (POA) with the Coot algorithm. The proposed CPOA has attained a value of 1.342, 0.549, and 0.634 for minimum Renyi-entropy-based betweenness, fitness of.

Keywords: influent nodes; overlapping community expansion; complex networks; POA; Puzzle Optimisation Algorithm; coot algorithm.

DOI: 10.1504/IJNVO.2024.144079

International Journal of Networking and Virtual Organisations, 2024 Vol.31 No.4, pp.281 - 305

Received: 11 May 2024
Accepted: 27 Aug 2024
Published online: 24 Jan 2025 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article