An Effective Approach for Modular Community Detection in Bipartite Network Based on Integrating Rider with Harris Hawks Optimization Algorithms
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...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Hindawi Limited
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/d116b76c79b64bba981179adbe05f67e |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | 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. |
|---|