期刊
SOFT COMPUTING
卷 17, 期 6, 页码 925-937出版社
SPRINGER
DOI: 10.1007/s00500-012-0942-1
关键词
Extended compact genetic algorithms; Community detection; Complex networks
资金
- National Natural Science Foundation of China [61132009, 61271374]
- Beijing Natural Science Foundation [4122068]
Complex networks are often studied as graphs, and detecting communities in a complex network can be modeled as a seriously nonlinear optimization problem. Soft computing techniques have shown promising results for solving this problem. Extended compact genetic algorithm (ECGA) use statistical learning mechanism to build a probability distribution model of all individuals in a population, and then create new population by sampling individuals according to their probability distribution instead of using traditional crossover and mutation operations. ECGA has distinct advantages in solving nonlinear and variable-coupled optimization problems. This paper attempts to apply ECGA to explore community structure in complex networks. Experimental results based on the GN benchmark networks, the LFR benchmark networks, and six real-world complex networks, show that ECGA is more effective than some other algorithms of community detection.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据