IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i15p3284-d1202958.html
   My bibliography  Save this article

GLOD: The Local Greedy Expansion Method for Overlapping Community Detection in Dynamic Provenance Networks

Author

Listed:
  • Ying Song

    (Department of Computer, Beijing Information Science and Technology University, Beijing 100101, China)

  • Zhiwen Zheng

    (Department of Computer, Beijing Information Science and Technology University, Beijing 100101, China
    R&D Center, Beijing Guowang Fuda Science & Technology Development Co., Ltd., Beijing 100070, China)

  • Yunmei Shi

    (Department of Computer, Beijing Information Science and Technology University, Beijing 100101, China)

  • Bo Wang

    (Software Engineering College, Zhengzhou University of Light Industry, Zhengzhou 450002, China)

Abstract

Local overlapping community detection is a hot problem in the field of studying complex networks. It is the process of finding dense clusters based on local network information. This paper proposes a method called local greedy extended dynamic overlapping community detection (GLOD) to address the challenges of detecting high-quality overlapping communities in complex networks. The goal is to improve the accuracy of community detection by considering the dynamic nature of community boundaries and leveraging local network information. The GLOD method consists of several steps. First, a coupling seed is constructed by selecting nodes from blank communities (i.e., nodes not assigned to any community) and their similar neighboring nodes. This seed serves as the starting point for community detection. Next, the seed boundaries are extended by applying multiple community fitness functions. These fitness functions determine the likelihood of nodes belonging to a specific community based on various local network properties. By iteratively expanding the seed boundaries, communities with higher density and better internal structure are formed. Finally, the overlapping communities are merged using an improved version of the Jaccard coefficient, which is a measure of similarity between sets. This step ensures that overlapping nodes between communities are properly identified and accounted for in the final community structure. The proposed method is evaluated using real networks and three sets of LFR (Lancichinetti–Fortunato–Radicchi) networks, which are synthetic benchmark networks widely used in community detection research. The experimental results demonstrate that GLOD outperforms existing algorithms and achieves a 2.1% improvement in the F-score, a community quality evaluation metric, compared to the LOCD framework. It outperforms the best existing LOCD algorithm on the real provenance network. In summary, the GLOD method aims to overcome the limitations of existing community detection algorithms by incorporating local network information, considering overlapping communities, and dynamically adjusting community boundaries. The experimental results suggest that GLOD is effective in improving the quality of community detection in complex networks.

Suggested Citation

  • Ying Song & Zhiwen Zheng & Yunmei Shi & Bo Wang, 2023. "GLOD: The Local Greedy Expansion Method for Overlapping Community Detection in Dynamic Provenance Networks," Mathematics, MDPI, vol. 11(15), pages 1-16, July.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:15:p:3284-:d:1202958
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/15/3284/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/15/3284/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yubo Peng & Bofeng Zhang & Furong Chang, 2021. "Overlapping Community Detection of Bipartite Networks Based on a Novel Community Density," Future Internet, MDPI, vol. 13(4), pages 1-21, March.
    2. Jeub, Lucas G. S. & Mahoney, Michael W. & Mucha, Peter J. & Porter, Mason A., 2017. "A local perspective on community structure in multilayer networks," Network Science, Cambridge University Press, vol. 5(2), pages 144-163, June.
    3. 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.
    4. Ann E. Krause & Kenneth A. Frank & Doran M. Mason & Robert E. Ulanowicz & William W. Taylor, 2003. "Compartments revealed in food-web structure," Nature, Nature, vol. 426(6964), pages 282-285, November.
    5. Hao Xu & Yuan Ran & Junqian Xing & Li Tao, 2023. "An Influence-Based Label Propagation Algorithm for Overlapping Community Detection," Mathematics, MDPI, vol. 11(9), pages 1-17, May.
    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. 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.
    2. Selen Onel & Abe Zeid & Sagar Kamarthi, 2011. "The structure and analysis of nanotechnology co-author and citation networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 89(1), pages 119-138, October.
    3. Federico Botta & Charo I del Genio, 2017. "Analysis of the communities of an urban mobile phone network," PLOS ONE, Public Library of Science, vol. 12(3), pages 1-14, March.
    4. Carlo Piccardi, 2011. "Finding and Testing Network Communities by Lumped Markov Chains," PLOS ONE, Public Library of Science, vol. 6(11), pages 1-13, November.
    5. Andrea Lancichinetti & Filippo Radicchi & José J Ramasco & Santo Fortunato, 2011. "Finding Statistically Significant Communities in Networks," PLOS ONE, Public Library of Science, vol. 6(4), pages 1-18, April.
    6. Eustace, Justine & Wang, Xingyuan & Cui, Yaozu, 2015. "Community detection using local neighborhood in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 665-677.
    7. Xiao‐Bing Hu & Hang Li & XiaoMei Guo & Pieter H. A. J. M. van Gelder & Peijun Shi, 2019. "Spatial Vulnerability of Network Systems under Spatially Local Hazards," Risk Analysis, John Wiley & Sons, vol. 39(1), pages 162-179, January.
    8. Jorge Peña & Yannick Rochat, 2012. "Bipartite Graphs as Models of Population Structures in Evolutionary Multiplayer Games," PLOS ONE, Public Library of Science, vol. 7(9), pages 1-13, September.
    9. Pirvu Daniela & Barbuceanu Mircea, 2016. "Recent Contributions Of The Statistical Physics In The Research Of Banking, Stock Exchange And Foreign Exchange Markets," Annals - Economy Series, Constantin Brancusi University, Faculty of Economics, vol. 2, pages 85-92, April.
    10. Daniel M. Ringel & Bernd Skiera, 2016. "Visualizing Asymmetric Competition Among More Than 1,000 Products Using Big Search Data," Marketing Science, INFORMS, vol. 35(3), pages 511-534, May.
    11. 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).
    12. Shang, Jiaxing & Liu, Lianchen & Li, Xin & Xie, Feng & Wu, Cheng, 2016. "Targeted revision: A learning-based approach for incremental community detection in dynamic networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 443(C), pages 70-85.
    13. Roth, Camille, 2007. "Empiricism for descriptive social network models," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 378(1), pages 53-58.
    14. Chakraborty, Abhijit & Krichene, Hazem & Inoue, Hiroyasu & Fujiwara, Yoshi, 2019. "Characterization of the community structure in a large-scale production network in Japan," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 513(C), pages 210-221.
    15. Shiau, Wen-Lung & Dwivedi, Yogesh K. & Yang, Han Suan, 2017. "Co-citation and cluster analyses of extant literature on social networks," International Journal of Information Management, Elsevier, vol. 37(5), pages 390-399.
    16. Zhang, Zhiwei & Wang, Zhenyu, 2015. "Mining overlapping and hierarchical communities in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 421(C), pages 25-33.
    17. J. Sylvan Katz & Guillermo Armando Ronda-Pupo, 2019. "Cooperation, scale-invariance and complex innovation systems: a generalization," Scientometrics, Springer;Akadémiai Kiadó, vol. 121(2), pages 1045-1065, November.
    18. Masa Tsuchiya & Vincent Piras & Alessandro Giuliani & Masaru Tomita & Kumar Selvarajoo, 2010. "Collective Dynamics of Specific Gene Ensembles Crucial for Neutrophil Differentiation: The Existence of Genome Vehicles Revealed," PLOS ONE, Public Library of Science, vol. 5(8), pages 1-10, August.
    19. 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.
    20. Atieh Mirshahvalad & Johan Lindholm & Mattias Derlén & Martin Rosvall, 2012. "Significant Communities in Large Sparse Networks," PLOS ONE, Public Library of Science, vol. 7(3), pages 1-7, March.

    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:gam:jmathe:v:11:y:2023:i:15:p:3284-:d:1202958. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.