6
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      An Effective Approach for Modular Community Detection in Bipartite Network Based on Integrating Rider with Harris Hawks Optimization Algorithms

      1 , 2 , 3 , 4
      Journal of Mathematics
      Hindawi Limited

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          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.

          Related collections

          Most cited references33

          • Record: found
          • Abstract: found
          • Article: not found

          Fast unfolding of communities in large networks

          Journal of Statistical Mechanics: Theory and Experiment, 2008(10), P10008
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Harris hawks optimization: Algorithm and applications

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Community structure in social and biological networks.

              A number of recent studies have focused on the statistical properties of networked systems such as social networks and the Worldwide Web. Researchers have concentrated particularly on a few properties that seem to be common to many networks: the small-world property, power-law degree distributions, and network transitivity. In this article, we highlight another property that is found in many networks, the property of community structure, in which network nodes are joined together in tightly knit groups, between which there are only looser connections. We propose a method for detecting such communities, built around the idea of using centrality indices to find community boundaries. We test our method on computer-generated and real-world graphs whose community structure is already known and find that the method detects this known structure with high sensitivity and reliability. We also apply the method to two networks whose community structure is not well known--a collaboration network and a food web--and find that it detects significant and informative community divisions in both cases.
                Bookmark

                Author and article information

                Contributors
                (View ORCID Profile)
                (View ORCID Profile)
                (View ORCID Profile)
                Journal
                Journal of Mathematics
                Journal of Mathematics
                Hindawi Limited
                2314-4785
                2314-4629
                November 16 2021
                November 16 2021
                : 2021
                : 1-16
                Affiliations
                [1 ]Department of Information Systems, College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia
                [2 ]Faculty of Engineering and Information Technology, Taiz University, Taiz 6803, Yemen
                [3 ]Department of Computer Science, College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia
                [4 ]Lappeenranta-Lahti University of Technology (LUT), Department of Software Engineering, Lappeenranta 53851, Finland
                Article
                10.1155/2021/9511425
                78320f97-06ea-428c-90b4-5ea9d5b2797b
                © 2021

                https://creativecommons.org/licenses/by/4.0/

                History

                Comments

                Comment on this article