By Topic

Fast method of detecting communities in complex networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bin Liu ; Comput. Sch., Wuhan Univ., Wuhan, China ; Jing Li

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.

Published in:

Computational Intelligence and Industrial Applications, 2009. PACIIA 2009. Asia-Pacific Conference on  (Volume:2 )

Date of Conference:

28-29 Nov. 2009