IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0140133.html
   My bibliography  Save this article

A Shadowing Problem in the Detection of Overlapping Communities: Lifting the Resolution Limit through a Cascading Procedure

Author

Listed:
  • Jean-Gabriel Young
  • Antoine Allard
  • Laurent Hébert-Dufresne
  • Louis J Dubé

Abstract

Community detection is the process of assigning nodes and links in significant communities (e.g. clusters, function modules) and its development has led to a better understanding of complex networks. When applied to sizable networks, we argue that most detection algorithms correctly identify prominent communities, but fail to do so across multiple scales. As a result, a significant fraction of the network is left uncharted. We show that this problem stems from larger or denser communities overshadowing smaller or sparser ones, and that this effect accounts for most of the undetected communities and unassigned links. We propose a generic cascading approach to community detection that circumvents the problem. Using real and artificial network datasets with three widely used community detection algorithms, we show how a simple cascading procedure allows for the detection of the missing communities. This work highlights a new detection limit of community structure, and we hope that our approach can inspire better community detection algorithms.

Suggested Citation

  • Jean-Gabriel Young & Antoine Allard & Laurent Hébert-Dufresne & Louis J Dubé, 2015. "A Shadowing Problem in the Detection of Overlapping Communities: Lifting the Resolution Limit through a Cascading Procedure," PLOS ONE, Public Library of Science, vol. 10(10), pages 1-19, October.
    • Handle: RePEc:plo:pone00:0140133
    DOI: 10.1371/journal.pone.0140133
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0140133
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0140133&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0140133?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
    ---><---

    References listed on IDEAS

    as
    1. Gergely Palla & Imre Derényi & Illés Farkas & Tamás Vicsek, 2005. "Uncovering the overlapping community structure of complex networks in nature and society," Nature, Nature, vol. 435(7043), pages 814-818, June.
    2. Yong-Yeol Ahn & James P. Bagrow & Sune Lehmann, 2010. "Link communities reveal multiscale complexity in networks," Nature, Nature, vol. 466(7307), pages 761-764, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yu, Shuo & Alqahtani, Fayez & Tolba, Amr & Lee, Ivan & Jia, Tao & Xia, Feng, 2022. "Collaborative Team Recognition: A Core Plus Extension Structure," Journal of Informetrics, Elsevier, vol. 16(4).
    2. Wu, Zhihao & Lin, Youfang & Wan, Huaiyu & Tian, Shengfeng & Hu, Keyun, 2012. "Efficient overlapping community detection in huge real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(7), pages 2475-2490.
    3. Zhou, Xu & Liu, Yanheng & Wang, Jian & Li, Chun, 2017. "A density based link clustering algorithm for overlapping community detection in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 65-78.
    4. Franke, R., 2016. "CHIMERA: Top-down model for hierarchical, overlapping and directed cluster structures in directed and weighted complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 384-408.
    5. Badie, Reza & Aleahmad, Abolfazl & Asadpour, Masoud & Rahgozar, Maseud, 2013. "An efficient agent-based algorithm for overlapping community detection using nodes’ closeness," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(20), pages 5231-5247.
    6. Wang, Yuyao & Bu, Zhan & Yang, Huan & Li, Hui-Jia & Cao, Jie, 2021. "An effective and scalable overlapping community detection approach: Integrating social identity model and game theory," Applied Mathematics and Computation, Elsevier, vol. 390(C).
    7. Xiaofeng Wang & Gongshen Liu & Jianhua Li & Jan P Nees, 2017. "Locating Structural Centers: A Density-Based Clustering Method for Community Detection," PLOS ONE, Public Library of Science, vol. 12(1), pages 1-23, January.
    8. Kibae Kim & Jörn Altmann & Sodam Baek, 2015. "Role of Platform Providers in Software Ecosystems," TEMEP Discussion Papers 2015120, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Jan 2015.
    9. Yi-Shan Sung & Dashun Wang & Soundar Kumara, 0. "Uncovering the effect of dominant attributes on community topology: A case of facebook networks," Information Systems Frontiers, Springer, vol. 0, pages 1-12.
    10. Zhang, Hongli & Gao, Yang & Zhang, Yue, 2018. "Overlapping communities from dense disjoint and high total degree clusters," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 286-298.
    11. Cui, Xue-Mei & Yoon, Chang No & Youn, Hyejin & Lee, Sang Hoon & Jung, Jean S. & Han, Seung Kee, 2017. "Dynamic burstiness of word-occurrence and network modularity in textbook systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 487(C), pages 103-110.
    12. Gholami, Maryam & Sheikhahmadi, Amir & Khamforoosh, Keyhan & Jalili, Mahdi, 2022. "Overlapping community detection in networks based on Neutrosophic theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
    13. Eustace, Justine & Wang, Xingyuan & Cui, Yaozu, 2015. "Overlapping community detection using neighborhood ratio matrix," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 421(C), pages 510-521.
    14. Gui, Chun & Zhang, Ruisheng & Hu, Rongjing & Huang, Guoming & Wei, Jiaxuan, 2018. "Overlapping communities detection based on spectral analysis of line graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 498(C), pages 50-65.
    15. Sun, Peng Gang & Wu, Xunlian & Quan, Yining & Miao, Qiguang, 2022. "Influence percolation method for overlapping community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 596(C).
    16. Zhou, Xu & Liu, Yanheng & Zhang, Jindong & Liu, Tuming & Zhang, Di, 2015. "An ant colony based algorithm for overlapping community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 427(C), pages 289-301.
    17. Sun, Peng Gang, 2015. "Community detection by fuzzy clustering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 408-416.
    18. Yi-Shan Sung & Dashun Wang & Soundar Kumara, 2018. "Uncovering the effect of dominant attributes on community topology: A case of facebook networks," Information Systems Frontiers, Springer, vol. 20(5), pages 1041-1052, October.
    19. Mu, Caihong & Liu, Yong & Liu, Yi & Wu, Jianshe & Jiao, Licheng, 2014. "Two-stage algorithm using influence coefficient for detecting the hierarchical, non-overlapping and overlapping community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 408(C), pages 47-61.
    20. Gao, Yang & Zhang, Hongli & Zhang, Yue, 2019. "Overlapping community detection based on conductance optimization in large-scale networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 522(C), pages 69-79.

    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:plo:pone00:0140133. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.