IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/2942054.html
   My bibliography  Save this article

An Autonomous Divisive Algorithm for Community Detection Based on Weak Link and Link-Break Strategy

Author

Listed:
  • Xiaoyu Ding
  • Jianpei Zhang
  • Jing Yang
  • Yiran Shen

Abstract

Divisive algorithms are widely used for community detection. A common strategy of divisive algorithms is to remove the external links which connect different communities so that communities get disconnected from each other. Divisive algorithms have been investigated for several decades but some challenges remain unsolved: (1) how to efficiently identify external links, (2) how to efficiently remove external links, and (3) how to end a divisive algorithm with no help of predefined parameters or community definitions. To overcome these challenges, we introduced a concept of the weak link and autonomous division. The implementation of the proposed divisive algorithm adopts a new link-break strategy similar to a tug-of-war contest, where communities act as contestants and weak links act as breakable ropes. Empirical evaluations on artificial and real-world networks show that the proposed algorithm achieves a better accuracy-efficiency trade-off than some of the latest divisive algorithms.

Suggested Citation

  • Xiaoyu Ding & Jianpei Zhang & Jing Yang & Yiran Shen, 2018. "An Autonomous Divisive Algorithm for Community Detection Based on Weak Link and Link-Break Strategy," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-12, January.
    • Handle: RePEc:hin:jnlmpe:2942054
    DOI: 10.1155/2018/2942054
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2018/2942054.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2018/2942054.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2018/2942054?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:2942054. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.