Abstract

The strenuous mining and arduous discovery of the concealed community structure in complex networks has received tremendous attention by the research community and is a trending domain in the multifaceted network as it not only reveals details about the hierarchical structure of multifaceted network but also assists in better understanding of the core functions of the network and subsequently information recommendation. The bipartite networks belong to the multifaceted network whose nodes can be divided into a dissimilar node-set so that no edges assist between the vertices. Even though the discovery of communities in one-mode network is briefly studied, community detection in bipartite networks is not studied. In this paper, we propose a novel Rider-Harris Hawks Optimization (RHHO) algorithm for community detection in a bipartite network through node similarity. The proposed RHHO is developed by the integration of the Rider Optimization (RO) algorithm with the Harris Hawks Optimization (HHO) algorithm. Moreover, a new evaluation metric, i.e., h-Tversky Index (h-TI), is also proposed for computing node similarity and fitness is newly devised considering modularity. The goal of modularity is to quantify the goodness of a specific division of network to evaluate the accuracy of the proposed community detection. The quantitative assessment of the proposed approach, as well as thorough comparative evaluation, was meticulously conducted in terms of fitness and modularity over the citation networks datasets (cit-HepPh and cit-HepTh) and bipartite network datasets (Movie Lens 100 K and American Revolution datasets). The performance was analyzed for 250 iterations of the simulation experiments. Experimental results have shown that the proposed method demonstrated a maximal fitness of 0.74353 and maximal modularity of 0.77433, outperforming the state-of-the-art approaches, including h-index-based link prediction, such as Multiagent Genetic Algorithm (MAGA), Genetic Algorithm (GA), Memetic Algorithm for Community Detection in Bipartite Networks (MATMCD-BN), and HHO.

Highlights

  • The complex systems are deemed to be divided into multiple communities or modules

  • Results and Discussion e analysis of the community detection model using the proposed Rider-Harris Hawk Optimization (RHHO) is demonstrated with an effective comparative analysis to prove the effectiveness of the proposed model

  • Considering cit-HepPh, the maximal fitness is computed by proposed RHHO with 0.66048 whereas the fitness values of existing h-index-based link prediction, Multiagent Genetic Algorithm (MAGA), Genetic Algorithm (GA), MATMCD-BN, and Harris Hawks Optimization (HHO) are 0.130475, 0.574730, 0.59360, 0.60131, and 0.64708. e maximal modularity is computed by proposed RHHO with 0.77560 whereas the modularity values of existing h-index-based link prediction, MAGA, GA, MATMCD-BN, and HHO are 0.36686, 0.37422, 0.37475, 0.38952, and 0.39476, respectively

Read more

Summary

Introduction

The complex systems are deemed to be divided into multiple communities or modules. E principal purpose of this research is to devise a technique for community detection in bipartite network based on the node similarity. E techniques based on eight existing community detection algorithms using bipartite network are illustrated. The method failed to evaluate associated issues faced by the bipartite network considering Bi-EgoNet. Sun et al [29] designed BiAttracter for determining the two-mode communities using bipartite networks. Even though the method precisely determined the two-mode communities of bipartite network in less time, it failed to discover community detection considering heterogeneous network, multilevel network, and temporal network. (iv) In [9], h-index-based link prediction method was developed using the citation network Still, it did not consider the h-index and Tversky similarity indices and the Salton to improve performance. In onemode networks, the community discovery is widely studied, the community detections in bipartite networks have not been studied due to the fact that the projection loses important information of the original bipartite network

Objective
Step 2
Step 3
Step 5
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call