Skip to main content
SpringerLink
Log in

Weighted label propagation based on Local Edge Betweenness

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In complex networks, especially social networks, networks could be divided into disjoint partitions. However, nodes could be partitioned such that the number of internal edges (the edges between the vertices within the same partition) to the number of outer edges (edges between two vertices of different partitions) is high. Generally, these partitions are called communities. Detecting community structure helps data scientists to extract meaningful information from networks and analyze them. In the last decades, various algorithms have been proposed to detect communities in graphs, and each one has examined this issue from a different perspective. Yet, most of these algorithms have a significant time complexity and costly calculations that make them unsuitable to detect communities in large graphs with millions of edges and nodes. Label propagation algorithm (LPA), a fast random-based algorithm, can easily detect communities in big graphs, but its accuracy compared to other algorithms is low. In this paper, we have improved LPA accuracy, and to achieve this goal, we propagate label based on the Local Edge Betweenness score. The proposed algorithm, named Weighted Label Propagation based on Local Edge Betweenness, is able to identify distinct communities in both the real-world and artificial networks. Also, the proposed algorithm could detect communities in weighted graphs. Empirical experiments show that the accuracy and speed of the proposed algorithm are acceptable; additionally, the proposed algorithm is scalable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Duch J, Arenas A (2005) Community detection in complex networks using extremal optimization. Phys Rev E Statist Nonlinear Soft Matter Phys 72(2):1–4

    Article  Google Scholar 

  2. Newman M (2010) Networks: an introduction. Oxford University Press, Oxford

    Book  Google Scholar 

  3. Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci US A 99(12):7821–6

    Article  MathSciNet  Google Scholar 

  4. Condon A, Karp RM (1999) Algorithms for graph partitioning on the planted partition model. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 1671:221–232

    MathSciNet  MATH  Google Scholar 

  5. Shrivastavajmlr A, Li P (2014) In defense of MinHash over SimHash. Jmlr W&Cp 33(33):886–894

    Google Scholar 

  6. Gopalan PK, Blei DM (2013) Efficient discovery of overlapping communities in massive networks. Proc Natl Acad Sci U S A 110(36):14534–14539

    Article  MathSciNet  Google Scholar 

  7. Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E Stat Nonlinear Soft Matter Phys 78(4):1–5

    Article  Google Scholar 

  8. Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifying communities in networks. Proc Natl Acad Sci U S A 101(9):2658–2663

    Article  Google Scholar 

  9. Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E Stat Nonlinear Soft Matter Phys 76(3):1–11

    Article  Google Scholar 

  10. Gregory S (2008) Local betweenness for finding communities in networks. University of Bristol, Tech. Rep

  11. Barber MJ, Clark JW (2009) Detecting network communities by propagating labels under constraints. Phys Rev E Stat Nonlinear Soft Matter Phys 80(2):1–11

    Article  Google Scholar 

  12. Liu X, Murata T (2010) Advanced modularity-specialized label propagation algorithm for detecting communities in networks. Phys A Stat Mech Appl 389(7):1493–1500

    Article  Google Scholar 

  13. Xu-bin KANG, Cai-yan JIA (2013) An improved fast community detection algorithm based on label propagation. J Hefei Univ Technol (Natural Science) 1:11

    Google Scholar 

  14. Xing Y, Meng F, Yong ZM, Zhu MS, Sun G (2014) A node influence based label propagation algorithm for community detection in networks. The Scientific World Journal 2014:

    Google Scholar 

  15. Francisquini R, Rosset V, Nascimento MCV (2017) GA-LP: a genetic algorithm based on label propagation to detect communities in directed networks. Expert Syst Appl 74:127–138

    Article  Google Scholar 

  16. Zhang X-K, Ren J, Song C, Jia J, Zhang Q (2017) Label propagation algorithm for community detection based on node importance and label influence. Phys Lett A 381(33):2691–2698

    Article  MathSciNet  Google Scholar 

  17. Zhuoxiang Z, Yitong W, Jiatang T, Zexu Z (2011) A novel algorithm for community discovery in social networkss based on label propagation. J Comput Res Dev 3:8–15

    Google Scholar 

  18. Lou H, Li S, Zhao Y (2013) Detecting community structure using label propagation with weighted coherent neighborhood propinquity. Phys A Stat Mech Appl 392:3095–3105

    Article  Google Scholar 

  19. Chen N, Liu Y, Chen H, Cheng J (2017) Detecting communities in social networks using label propagation with information entropy. Phys A Stat Mech Appl 471:788–798

    Article  Google Scholar 

  20. Zhang X-K, Fei S, Song C, Tian X, Ao Y-Y (2015) Label propagation algorithm based on local cycles for community detection. Int J Mod Phys B 29(05):1550029

    Article  MathSciNet  Google Scholar 

  21. Xie J, Szymanski BK, Liu X (2011) SLPA: uncovering overlapping communities in social networks via a speaker–listener interaction dynamic process. In: 2011 IEEE 11th International Conference on Data Mining Workshops, pp 344–349. IEEE

  22. Gregory S (2010) Finding overlapping communities in networks by label propagation. New J Phys 12(10):103018

    Article  Google Scholar 

  23. Zhang X-K, Tian X, Li Y-N, Song C (2014) Label propagation algorithm based on edge clustering coefficient for community detection in complex networks. Int J Mod Phys B 28(30):1450216

    Article  MathSciNet  Google Scholar 

  24. Wang M, Wang C, Yu JX, Zhang J (2015) Community Detection in Social Networks : An In-depth Benchmarking Study with a Procedure-Oriented Framework. Proc VLDB Endow 8(10):998–1009

    Article  Google Scholar 

  25. Pei T, Zhang H, Li Z, Choi Y (2014) Survey of community structure segmentation in complex networks. J Softw 9(1):89–93

    Google Scholar 

  26. Harenberg S, Bello G, Gjeltema L, Ranshous S, Harlalka J, Seay R, Padmanabhan K, Samatova N (2014) Community detection in large-scale networks: a survey and empirical evaluation. Wiley Interdiscip Rev Comput Stat 6(6):426–439

    Article  Google Scholar 

  27. Xie J, Kelley S, Szymanski BK (2013) Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput Surv 45(4):43:1–43:35

    Article  Google Scholar 

  28. Plantié Michel, Crampes Michel (2013) Survey on social community detection. Social Media Retrieval, pp 65–85

  29. Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452–473

    Article  Google Scholar 

  30. Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):26113

    Article  Google Scholar 

  31. McDaid AF, Greene D, Hurley N (2011) Normalized mutual information to evaluate overlapping community finding algorithms. arXiv preprintarXiv:1110.2515

  32. Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations: can geographic isolation explain this unique trait? Behavi Ecol Sociobiol 54(4):396–405

    Article  Google Scholar 

  33. Newman MEJ, Watts DJ, Strogatz SH (2002) Random graph models of social networks. Proc Natl Acad Sci 99(suppl 1):2566–2572

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Amirkabir University of Technology, No. 350, Hafez Ave, Valiasr Square, Tehran, Iran

    Hamid Shahrivari Joghan, Alireza Bagheri & Meysam Azad

Authors
  1. Hamid Shahrivari Joghan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alireza Bagheri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Meysam Azad
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hamid Shahrivari Joghan.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shahrivari Joghan, H., Bagheri, A. & Azad, M. Weighted label propagation based on Local Edge Betweenness. J Supercomput 75, 8094–8114 (2019). https://doi.org/10.1007/s11227-019-02978-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-019-02978-4

Keywords

Search

Navigation