|
|
|
| Finding Overlapping Community in Network by Using Modularity and Partition Density |
| REN Chenglei, HAN Dingding, PU Peng, ZHANG Jiacheng
|
| School of Information Science and Technology, East China Normal University, Shanghai 200241, China |
|
|
|
|
Abstract The algorithms of detecting community in complex networks now have lots of disadvantages such as high complexity and ignorance of accurate overlapping nodes. This paper proposes a highly efficient, rapid and accurate community detection algorithm. Based on greedy algorithm, the community is divided by establishing the modularity matrix and adopting the data structure. Considering the edges between local communities, the overlapping community structure is accurately dug by computing the partition density. We evaluate our methods using both synthetic benchmarks and real-world networks, demonstrating the effectiveness of our approach. Our method runs in essentially linear time.
|
|
Received: 09 July 2015
Published: 25 February 2025
|
|
|
|
|
|
|
|
|
