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

On the reduction of instability of label propagation algorithm

Author

Listed:
  • Maryam Yazdani

    (Department of Algorithms and Computation, School of Engineering Science, College of Engineering, University of Tehran, Iran)

  • Ali Moeini

    (Department of Algorithms and Computation, School of Engineering Science, College of Engineering, University of Tehran, Iran)

  • Mojtaba Mazoochi

    (ICT Research Institute, Tehran, Iran)

  • Farzaneh Rahmani

    (ICT Research Institute, Tehran, Iran)

  • Leila Rabiei

    (ICT Research Institute, Tehran, Iran)

Abstract

Label propagation algorithm is widely used for community detection in a network due to its linear time complexity. It also does not need any predefined information such as the number of communities. However, the results of this algorithm are not stable because of the randomness strategy used in its propagation process. In this paper, a modification on label propagation strategy is proposed in which labels are propagated based on nodes importance defined by their positions and popularity among neighbors. The proposed strategy is an updating process which reduces the instability of the label propagation algorithm. Experiments on real-world and synthetic networks show that the proposed method improves accuracy in terms of modularity, NMI and ARI. Also, the method has an acceptable execution time.

Suggested Citation

  • Maryam Yazdani & Ali Moeini & Mojtaba Mazoochi & Farzaneh Rahmani & Leila Rabiei, 2023. "On the reduction of instability of label propagation algorithm," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 34(04), pages 1-21, April.
    • Handle: RePEc:wsi:ijmpcx:v:34:y:2023:i:04:n:s0129183123500535
    DOI: 10.1142/S0129183123500535
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183123500535
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183123500535?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:34:y:2023:i:04:n:s0129183123500535. 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.