J4 ›› 2013, Vol. 40 ›› Issue (3): 205-211.doi: 10.3969/j.issn.1001-2400.2013.03.031

• Original Articles • Previous Articles     Next Articles

Revealing of  the hierarchy community of the complex network by decomposition multi-objective optimization

CHEN Guoqiang1,2;WANG Yuping1   

  1. (1. School of Computer Science and Technology, Xidian Univ., Xi'an  710071, China;
    2. School of Computer and Information Engineering, Henan Univ., Kaifeng  475004, China)
  • Received:2012-02-17 Online:2013-06-20 Published:2013-07-29
  • Contact: CHEN Guoqiang E-mail:chengq08@163.com

Abstract:

A new algorithm for community detection of complex networks is proposed. The problem of community detection is considered as multi-objective optimization problem. Tradeoff among multi-objectives realizes the detection of the community structure in a wider spread space, the disadvantages of the traditional single optimization algorithm is overcome. The MOEA/D framework is adopted and the Tchebycheff decomposition technique is used. A simulated annealing based weighted-sum method is used to perform local search which can expand the search scope, and not easily fall into local optimal solution. Finally, simulation experiments are done to test the algorithm using artificial and reality networks. The results show that, compared with existing algorithms, the algorithm has a higher detection accuracy and a small amount of computation, and can reveal the hierarchy community structure of the complex network by Pareto optimal solutions.

Key words: complex networks, community detection, multi objective optimization, hierarchy structure

CLC Number: 

  • TP393