The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
Overlapping Community Discovery Based on Node Hierarchy and Label Propagation Gain
Author(s): 
Pages: 289-298
Year: Issue:  4
Journal: Pattern Recognition and Artificial Intelligence

Keyword:  Overlapping Community DetectionMulti-label PropagationNode HierarchyPropagation GainNode Centrality;
Abstract: The time complexity of multi-label propagation algorithm( MLPA) is nearly linear. However,when it is applied to overlapping community discovery,the accuracy and the stability of MLPA are poor.Inspired by the idea that overlapping nodes are more probable to appear in the boundary regions of different communities,an overlapping community discovery algorithm based on node hierarchy and label propagation gain is proposed in this paper. Firstly,the improved single label propagation with node centrality and community distribution constraints is utilized to unfold preliminary non-overlapping communities and centrality values of nodes are calculated by local information in the propagation process simultaneously. Furthermore,node hierarchy partition function is defined according to centrality values of nodes and employed to mark the hierarchy of each node in its respective community. Finally,based on the label propagation gain among nodes,a new multi-label updating rule is designed to obtain the final overlapping communities. Extensive experimental results on synthetic and real-world networks validate that the proposed algorithm effectively improves the accuracy and stability.
Related Articles
No related articles found