Advertisement
Published in:
2011 | OriginalPaper | Chapter
Uncovering Overlapping Community Structure
Authors : Qinna Wang, Eric Fleury
Published in: Complex Networks
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Overlapping community structure has attracted much interest in recent years since Palla et al. proposed the
k
-clique percolation algorithm for community detection and pointed out that the overlapping community structure is more reasonable to capture the topology of networks. Despite many efforts to detect overlapping communities, the overlapping community problem is still a great challenge in complex networks. Here we introduce an approach to identify overlapping community structure based on an efficient partition algorithm. In our method, communities are formed by adding peripheral nodes to cores. Therefore, communities are allowed to overlap. We show experimental studies on synthetic networks to demonstrate that our method has excellent performances in community detection.