Degree and betweenness-based label propagation for community detection

Qiufen Ni (), Jun Wang () and Zhongzheng Tang ()
Additional contact information
Qiufen Ni: Guangdong University of Technology
Jun Wang: Guangdong University of Technology
Zhongzheng Tang: Beijing University of Posts and Telecommunications

Journal of Combinatorial Optimization, 2025, vol. 49, issue 2, No 4, 18 pages

Abstract: 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.

Keywords: Community detection; Betweenness centrality; Layer-by-layer label propagation (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-024-01254-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:2:d:10.1007_s10878-024-01254-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-024-01254-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().