2013/03/24 by Dayou Liu, Di Jin, Carlos Baquero +3
Computer Science · Physics and Astronomy · #cs.SI #physics.soc-ph
paper · pdf · doi:10.1080/18756891.2013.773175
published as International Journal of Computational Intelligence Systems, Vol. 6, No. 2 (March, 2013), 354-369 · 17 pages, 8 figures. arXiv admin note: text overlap with arXiv:1303.4711
arxiv created 2013/03/24 · arxiv updated 2013/03/26
In order to further improve the performance of current genetic algorithms aiming at discovering communities, a local search based genetic algorithm GALS is here proposed. The core of GALS is a local search based mutation technique. In order to overcome the drawbacks of traditional mutation methods, the paper develops the concept of marginal gene and then the local monotonicity of modularity function Q is deduced from each nodes local view. Based on these two elements, a new mutation method combined with a local search strategy is presented. GALS has been evaluated on both synthetic benchmarks and several real networks, and compared with some presently competing algorithms. Experimental results show that GALS is highly effective and efficient for discovering community structure.