%0 Journal Article
%A FANG Ping1
%A 3
%A 4
%A LI Zhitang2
%A 3
%A 4
%A TU Hao2
%A 4
%A GUO Zhengbiao3
%A 4
%T Closeness degree of node algorithm for mining local community from complex networks
%D 2013
%R
%J Computer Engineering and Applications
%P 38-42
%V 49
%N 17
%X To make the local community detection faster and more accurate, this paper proposes an algorithm for detecting local community structures in complex networks based on closeness degree of node. The proposed method, which uses the maximal closeness degree of node and the local community’s Q value, starts from the maximum degree node of the network and detects the community it belongs to by searching the neighbor nodes. It is also applicable for global community structure detecting. The experiments on two typical complex networks show that the algorithm can effectively mine the intrinsic local community structure in networks. The time complexity of the algorithm is O（nlog（n）） on a sparse graph, where n is the number of nodes.
%U http://cea.ceaj.org/EN/abstract/article_30871.shtml