Journal
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
Volume 388, Issue 13, Pages 2741-2749Publisher
ELSEVIER
DOI: 10.1016/j.physa.2009.03.022
Keywords
Complex networks; Heuristic algorithm; Community structure; Community size; Connecting degree
Categories
Funding
- National High-Tech Research and Development Plan of China [2006AAOIZ414, 2007AAOIZ440]
- Chinese Information Security Research Plan [(242)2007B27]
Ask authors/readers for more resources
Community structure is an important property of complex networks. How to detect the communities is significant for understanding the network structure and to analyze the network properties. Many algorithms. such as K-L and GN, have been proposed to detect community structures in complex networks. According to daily experience, a community should have many nodes and connections. Based oil these principles and existing researches, a fast and efficient algorithm for detecting community structures in complex networks is proposed in this paper. The key strategy of the algorithm is to mine a node with the closest relations with the community and assign it to this community. Four real-world networks are used to test the performance of the algorithm. Experimental results demonstrate that the algorithm proposed is rather efficient for detecting community structures in complex networks. (C) 2009 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available