Detecting Community Structure in Networks by Propagating Labels of Nodes

Authors:
Chuanjun Pang;Fengjing Shao;Rencheng Sun;Shujing Li
Affiliations:
Information Engineering College of Qingdao University,;Information Engineering College of Qingdao University,;Information Engineering College of Qingdao University,;Information Engineering College of Qingdao University,
Venue:
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III
Year:
2009

Citing 3
Cited 0

Partitioning sparse matrices with eigenvectors of graphs

SIAM Journal on Matrix Analysis and Applications
Inferring Web communities from link topology

Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems
Self-Organization and Identification of Web Communities

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

Community structure is a common property of many networks. Automatically finding communities in networks can provide invaluable help in understanding the structure and the functionality of networks. Many algorithms to find communities have been developed in recent years. Here we devise a new algorithm to detect communities in networks--propagation algorithm. By propagating the labels of nodes in networks, detecting communities are transformed into analyzing the labels of nodes in networks in this algorithm. Real-world and computer-generated networks are used to verify this algorithm. The results of our experiments indicate that it is sensitive to community structure and effective at discovering communities in networks.