Local Core Members Aided Community Structure Detection

Abstract

The relationship of friends in social networks can be strong or weak. Some research works have shown that a close relationship between friends conducts good community structure. Based on this result, we propose an effective method in detecting community structure in social networks based on the closeness of relations among neighbors. This method calculates the gravity between each neighbor node to core nodes, then makes judgement if the node should be classified in the community or not, and finally form the process of community detection. The experimental results show that the proposed method can mine the social structure efficiently with a low computational complexity

References in corpus (5)

• Fast unfolding of communities in large networks
• Uncovering the overlapping community structure of complex networks in nature and society
• Maps of random walks on complex networks reveal community structure
• Near linear time algorithm to detect community structures in large-scale networks
• Towards real-time community detection in large networks