Indexed by:
Abstract:
Community detection in social networks is usually considered as an objective optimization problem. Due to the limitation of the objective function, the global optimum cannot describe the real partition well, and it is time consuming. In this paper, a novel PSO (particle swarm optimization) algorithm based on modularity optimization for community detection in social networks is proposed. Firstly, the algorithm takes similarity-based clustering to find core areas in the network, and then a modified particle swarm optimization is performed to optimize modularity in a new constructed weighted network which is compressed from the original one, and it is equivalent to optimize modularity in the original network with some restriction. Experiments are conducted in the synthetic and four real-world networks. The experimental results show that the proposed algorithm can effectively extract the intrinsic community structures of social networks. © Springer-Verlag Berlin Heidelberg 2013.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
ISSN: 1865-0929
Year: 2013
Volume: 401
Page: 266-275
Language: English
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count: 17
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 2
Affiliated Colleges: