IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v392y2013i4p941-952.html
   My bibliography  Save this article

Detection of community overlap according to belief propagation and conflict

Author

Listed:
  • Fu, Xianghua
  • Liu, Liandong
  • Wang, Chao

Abstract

Most existing methods for detection of community overlap cannot balance efficiency and accuracy for large and densely overlapping networks. To quickly identify overlapping communities for such networks, we propose a new method that uses belief propagation and conflict (PCB) to occupy communities. We first identify triangles with maximal clustering coefficients as seed nodes and sow a new type of belief to the seed nodes. Then the beliefs explore their territory by occupying nodes with high assent ability. The beliefs propagate their strength along the graph to consolidate their territory, and conflict with each other when they encounter the same node simultaneously. Finally, the node membership is judged from the belief vectors. The PCB time complexity is nearly linear and its space complexity is linear. The algorithm was tested in extensive experiments on three real-world social networks and three computer-generated artificial graphs. The experimental results show that PCB is very fast and highly reliable. Tests on real and artificial networks give excellent results compared with three newly proposed overlapping community detection algorithms.

Suggested Citation

  • Fu, Xianghua & Liu, Liandong & Wang, Chao, 2013. "Detection of community overlap according to belief propagation and conflict," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(4), pages 941-952.
    • Handle: RePEc:eee:phsmap:v:392:y:2013:i:4:p:941-952
    DOI: 10.1016/j.physa.2012.09.023
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437112008783
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2012.09.023?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.

    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. Shen, Huawei & Cheng, Xueqi & Cai, Kai & Hu, Mao-Bin, 2009. "Detect overlapping and hierarchical community structure in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(8), pages 1706-1712.
    3. István A Kovács & Robin Palotai & Máté S Szalay & Peter Csermely, 2010. "Community Landscapes: An Integrative Approach to Determine Overlapping Network Module Hierarchy, Identify Key Nodes and Predict Network Dynamics," PLOS ONE, Public Library of Science, vol. 5(9), pages 1-14, September.
    4. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. A. Tabrizi, Shayan & Shakery, Azadeh & Asadpour, Masoud & Abbasi, Maziar & Tavallaie, Mohammad Ali, 2013. "Personalized PageRank Clustering: A graph clustering algorithm based on random walks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(22), pages 5772-5785.
    2. Shang, Ronghua & Liu, Huan & Jiao, Licheng, 2017. "Multi-objective clustering technique based on k-nodes update policy and similarity matrix for mining communities in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 1-24.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Jiang, Yawen & Jia, Caiyan & Yu, Jian, 2013. "An efficient community detection method based on rank centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(9), pages 2182-2194.
    6. Wu, Jianshe & Wang, Xiaohua & Jiao, Licheng, 2012. "Synchronization on overlapping community network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(3), pages 508-514.
    7. 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).
    8. 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.
    9. Wu, Tao & Guo, Yuxiao & Chen, Leiting & Liu, Yanbing, 2016. "Integrated structure investigation in complex networks by label propagation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 448(C), pages 68-80.
    10. Lan Huang & Guishen Wang & Yan Wang & Enrico Blanzieri & Chao Su, 2013. "Link Clustering with Extended Link Similarity and EQ Evaluation Division," PLOS ONE, Public Library of Science, vol. 8(6), pages 1-18, June.
    11. 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.
    12. 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.
    13. Yang, Jin-Xuan & Zhang, Xiao-Dong, 2017. "Finding overlapping communities using seed set," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 467(C), pages 96-106.
    14. Supreet Mandala & Soundar Kumara & Kalyan Chatterjee, 2014. "A Game-Theoretic Approach to Graph Clustering," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 629-643, August.
    15. 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.
    16. 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.
    17. Zhenping Li & Xiang-Sun Zhang & Rui-Sheng Wang & Hongwei Liu & Shihua Zhang, 2013. "Discovering Link Communities in Complex Networks by an Integer Programming Model and a Genetic Algorithm," PLOS ONE, Public Library of Science, vol. 8(12), pages 1-10, December.
    18. Gao, Yang & Zhang, Hongli & Zhang, Yue, 2019. "Overlapping communities from lines and triangles in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 455-466.
    19. 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.
    20. 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.

    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:eee:phsmap:v:392:y:2013:i:4:p:941-952. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.