IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v30y2019i06ns0129183119500499.html
   My bibliography  Save this article

A novel node gravitation-based label propagation algorithm for community detection

Author

Listed:
  • Mengjia Shen

    (School of Information Science and Engineering, Lanzhou University, Lanzhou, Gansu 730000, P. R. China)

  • Zhixin Ma

    (School of Information Science and Engineering, Lanzhou University, Lanzhou, Gansu 730000, P. R. China)

Abstract

Community detection in networks is a very important area of research for revealing the structure and function of networks. Label propagation algorithm (LPA) has been widely used to detect communities in networks because it has the advantages of linear time complexity and is unnecessary to get prior information, such as objective function and the number of communities. However, LPA has the shortcomings of uncertainty and randomness in the label propagation process, which affects the accuracy and stability of the algorithm. In this paper, we propose a novel community detection algorithm, named NGLPA, in which labels are propagated by node gravitation defined by node importance and similarity between nodes. To select the label according to the gravitation between nodes can reduce the randomness of LPA and is consistent with reality. The proposed method is tested on several synthetic and real-world networks with comparative algorithms. The results show that NGLPA can significantly improve the quality of community detection and obtain accurate community structure.

Suggested Citation

  • Mengjia Shen & Zhixin Ma, 2019. "A novel node gravitation-based label propagation algorithm for community detection," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 30(06), pages 1-19, June.
  • Handle: RePEc:wsi:ijmpcx:v:30:y:2019:i:06:n:s0129183119500499
    DOI: 10.1142/S0129183119500499
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183119500499
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0129183119500499?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:30:y:2019:i:06:n:s0129183119500499. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.