.png){kind=icon}
Return
Enhancing betweenness algorithm for detecting communities in complex networks
.png){kind=icon}
PRE
AI
DOI：10.1142/s0217984914500742.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Community structure is an important topological property common to many social, biological and technological networks. First, by using the concept of the structural weight, we introduced an improved version of the betweenness algorithm of Girvan and Newman to detect communities in networks without (intrinsic) edge weight and then extended it to networks with (intrinsic) edge weight. The improved algorithm was tested on both artificial and real-world networks, and the results show that it can more effectively detect communities in networks both with and without (intrinsic) edge weight. Moreover, the technique for improving the betweenness algorithm in the paper may be directly applied to other community detection algorithms.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available