Skip to main content

Advertisement

Log in

Degree and betweenness-based label propagation for community detection

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Community detection, as a crucial network analysis technique, holds significant application value in uncovering the underlying organizational structure in complex networks. In this paper, we propose a degree and betweenness-based label propagation method for community detection (DBLPA). First, we calculate the importance of each node by combining node degree and betweenness centrality. A node i is considered as a core node in the network if its importance is maximal among its neighbor nodes. Next, layer-by-layer label propagation starts from core nodes. The first layer of nodes for label propagation consists of the first-order neighbors of all core nodes. In the first layer of label propagation, the labels of core nodes are first propagated to the non-common neighbor nodes between core nodes, and then to the common neighbor nodes between core nodes. At the same time, the flag parameter is set to record the changing times of a node’s label, which is helpful to calibrate the node’s labels during the label propagation. It effectively improves the misclassification in the process of label propagation. We test the DBLPA on four real network datasets and nine synthetic network datasets, and the experimental results show that the DBLPA can effectively improve the accuracy of community detection.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Algorithm 1
Algorithm 2
Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Data availability

Enquiries about data availability should be directed to the authors.

References

  • Blondel VD, Guillaume JL, Lambiotte R et al (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):P10008

    Article  MATH  Google Scholar 

  • Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30(1–7):107–117

    Article  MATH  Google Scholar 

  • Chen J, Yuan B (2006) Detecting functional modules in the yeast protein–protein interaction network. Bioinformatics 22(18):2283–2290

    Article  MATH  Google Scholar 

  • Danon L, Diaz-Guilera A, Duch J et al (2005) Comparing community structure identification. J Stat Mech Theory Exp 2005(09):P09008

    Article  Google Scholar 

  • Dong Y, Hu Z, Wang K et al (2020) Heterogeneous network representation learning. In: IJCAI, vol 20, pp 4861–4867

  • Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40:35–41

    Article  MATH  Google Scholar 

  • Freeman L (2004) The development of social network analysis. Study Sociol Sci 1(687):159–167

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Grady L (2006) Random walks for image segmentation. IEEE Trans Pattern Anal Mach Intell 28(11):1768–1783

    Article  MATH  Google Scholar 

  • He C, Zheng Y, Cheng J et al (2022) Semi-supervised overlapping community detection in attributed graph with graph convolutional autoencoder. Inf Sci 608:1464–1479

    Article  MATH  Google Scholar 

  • Jia Y, Zhang Q, Zhang W et al (2019) Communitygan: community detection with generative adversarial nets. In: The world wide web conference, pp 784–794

  • Krebs B (2004) Books about US politics. [Online]. http://www.orgnet.com

  • Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110

    Article  Google Scholar 

  • Li J, Lu K, Zhang J et al (2019) Heterogeneous network embedding based on meta-path selection. Knowl-Based Syst 163:624–633

    MATH  Google Scholar 

  • Lusseau D, Schneider K, Boisseau OJ et al (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations: can geographic isolation explain this unique trait? Behav Ecol Sociobiol 54:396–405

    Article  Google Scholar 

  • MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, vol 1, no 14, pp 281–297

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

    Article  MATH  Google Scholar 

  • Ni Q, Guo J, Wu W et al (2021) Continuous influence-based community partition for social networks. IEEE Trans Netw Sci Eng 9(3):1187–1197

    Article  MathSciNet  MATH  Google Scholar 

  • Ni Q, Guo J, Wu W et al (2022) Influence-based community partition with sandwich method for social networks. IEEE Trans Comput Soc Syst 10(2):819–830

    Article  MATH  Google Scholar 

  • Nocaj A, Ortmann M, Brandes U (2016) Adaptive disentanglement based on local clustering in small-world network visualization. IEEE Trans Visual Comput Graph 22(6):1662–1671

    Article  MATH  Google Scholar 

  • Peng H, Si S, Awad MK et al (2016) Toward energy-efficient and robust large-scale WSNs: a scale-free network approach. IEEE J Sel Areas Commun 34(12):4035–4047

    Article  MATH  Google Scholar 

  • Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3):036106

    Article  MATH  Google Scholar 

  • Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118–1123

    Article  MATH  Google Scholar 

  • Sun BJ, Shen H, Gao J et al (2017) A non-negative symmetric encoder–decoder approach for community detection. In: Proceedings of the ACM on conference on information and knowledge management, 2017, pp 597–606

  • Tong C, Niu J, Wen J et al (2015) Weighted label propagation algorithm for overlapping community detection. In: 2015 IEEE international conference on communications (ICC). IEEE, pp 1238–1243

  • Traag VA, Waltman L, Van Eck NJ (2019) From Louvain to Leiden: guaranteeing well-connected communities. Sci Rep 9(1):5233

    Article  MATH  Google Scholar 

  • Wang M, Xu Y (2019) Research on label propagation algorithms based on clustering coefficient. In: 2019 IEEE 4th international conference on cloud computing and big data analysis (ICCCBDA). IEEE, pp 348–352

  • Wang C, Pan S, Long G et al (2017) Mgae: marginalized graph autoencoder for graph clustering. In: Proceedings of the ACM on conference on information and knowledge management, 2017, pp 889–898

  • Yang J, McAuley J, Leskovec J (2013) Community detection in networks with node attributes. In: 2013 IEEE 13th international conference on data mining. IEEE, pp 1151–1156

  • Zhang Y, Xiong Y, Ye Y et al (2020) SEAL: Learning heuristics for community detection with generative adversarial networks. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp 1103–1113

  • Zhang S, Yu S, Xinhua E et al (2021) Label propagation algorithm joint multilayer neighborhood overlap and historic label similarity for community detection. IEEE Syst J 16(2):2626–2634

    Article  MATH  Google Scholar 

  • Zhang W, Shang R, Jiao L (2023) Large-scale community detection based on core node and layer-by-layer label propagation. Inf Sci 632:1–18

    Article  MATH  Google Scholar 

  • Zhao Y, Li S, Chen X (2012) Community detection using label propagation in entropic order. In: 2012 IEEE 12th international conference on computer and information technology. IEEE, pp 18–24

Download references

Funding

This work is supported in part by the National Natural Science Foundation of China under Grant No. 62202109, in part by the Guangzhou Basic and Applied Basic Research Foundation under Grant No. 2025A04J5116, and in part by the National Natural Science Foundation of China under Grant No. 12101069.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhongzheng Tang.

Ethics declarations

Competing interests

The authors have not disclosed any competing interests.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ni, Q., Wang, J. & Tang, Z. Degree and betweenness-based label propagation for community detection. J Comb Optim 49, 21 (2025). https://doi.org/10.1007/s10878-024-01254-3

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10878-024-01254-3

Keywords

Navigation