DocumentCode
3386996
Title
Fast method of detecting communities in complex networks
Author
Liu, Bin ; Li, Ling
Author_Institution
Comput. Sch., Wuhan Univ., Wuhan, China
Volume
2
fYear
2009
fDate
28-29 Nov. 2009
Firstpage
138
Lastpage
142
Abstract
In this paper we introduce a novel method, LCDA, to identify the communities in large complex network based on ¿local community¿. Time complexity of our algorithm is O(n<k>3 Ln(n) where <k> is the mean degree and n is the number of vertices in the network. It is very useful in analyzing very larger complex network. By applying LCDA on Zachary club network we get better structure than classical NG algorithm and higher speed than SA method. Our algorithm exhibits good accurateness by testing much larger complex networks further.
Keywords
complex networks; computational complexity; social networking (online); LCDA; Zachary club network; communities detection; complex networks; time complexity; Application software; Cities and towns; Clustering algorithms; Complex networks; Computational intelligence; Computer industry; Computer networks; Laboratories; Partitioning algorithms; Software engineering; community; complex network; modularity;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Industrial Applications, 2009. PACIIA 2009. Asia-Pacific Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-4606-3
Type
conf
DOI
10.1109/PACIIA.2009.5406619
Filename
5406619
Link To Document