Overlapping Community Detection based on Network Decomposition.

ABSTRACT: Community detection in complex network has become a vital step to understand the structure and dynamics of networks in various fields. However, traditional node clustering and relatively new proposed link clustering methods have inherent drawbacks to discover overlapping communities. Node clustering is inadequate to capture the pervasive overlaps, while link clustering is often criticized due to the high computational cost and ambiguous definition of communities. So, overlapping community detection is still a formidable challenge. In this work, we propose a new overlapping community detection algorithm based on network decomposition, called NDOCD. Specifically, NDOCD iteratively splits the network by removing all links in derived link communities, which are identified by utilizing node clu

SUBMITTER: Ding Z 

PROVIDER: S-EPMC4828636 | biostudies-literature | 2016 Apr

REPOSITORIES: biostudies-literature