• Refinement of the community detection performance by weighted relationship coupling

    • Fulltext

       

        Click here to view fulltext PDF


      Permanent link:
      https://www.ias.ac.in/article/fulltext/pram/088/03/0044

    • Keywords

       

      Network analysis; community structure; weighting scheme; k-strength relationship; modularity

    • Abstract

       

      The complexity of many community detection algorithms is usually an exponential function with the scale which hard to uncover community structure with high speed. Inspired by the ideas of the famous modularity optimization, in this paper, we proposed a proper weighting scheme utilizing a novel k-strength relationship whichnaturally represents the coupling distance between two nodes. Community structure detection using a generalized weighted modularity measure is refined based on the weighted k-strength matrix. We apply our algorithm on both the famous benchmark network and the real networks. Theoretical analysis and experiments show that the weighted algorithm can uncover communities fast and accurately and can be easily extended to large-scale real networks.

    • Author Affiliations

       

      DONG MIN1 KAI YU1 HUI-JIA LI2

      1. School of Computer Science and Engineering, Xinjiang University of Finance and Economics, Urumqi, Xinjiang 830001, China
      2. School of Management Science and Engineering, Central University of Finance and Economics, Beijing 100080, China
    • Dates

       
  • Pramana – Journal of Physics | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.