Abstract
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.
Similar content being viewed by others
References
Agarwal G, Kempe D (2008) Modularity-maximizing network communities via mathematical programming. Eur Phys J B 66:409–418
Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111
Clauset A, Moore C, Newman MEJ (2007) Structural inference of hierarchies in networks. In: Airoldi EM, Blei DM, Fienberg SE, Goldenberg A, Xing EP, Zheng AX (eds) Statistical network analysis: models, issues, and new directions. Springer, Germany, pp 1–13
Clauset A, Moore C, Newman MEJ (2008) Hierarchical structure and the prediction of missing links in networks. Nature 453:98–101
Conover W (1998) Practical nonparametric statistics, Wiley Series in Probability and Statistics, 1998
Danon L, Díaz-Guilera A, Duch J, Arenas A (2005) Comparing community structure identification. J Stat Mech (P09008)
Duan X, Wang C, Liu X, Lin Y (2008) Web community detection model using particle swarm optimization. Comput Sci 35(003):18–21
Duch J, Arenas A (2005) Community detection in complex networks using extremal optimization. Phys Rev E 72(2):027104
Duque TSPC, Goldberg DE (2009) ClusterMI: Building Probabilistic Models using Hierarchical Clustering and Mutual Information. IlliGAL Report No. 2009002, University of Illinois at Urbana-Champaign, Urbana, IL
Fortunato S (2010) Community detection in graphs. Phys Rep 486:75–174
Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821–7826
Gleiser PM, Danon L (2003) Community structure in Jazz. Adv Complex Syst 6:565–573
Guimerà R, Amaral LAN (2005) Functional cartography of complex metabolic networks. Nature 433:895–900
Guimerà R, Sales-Pardo M, Amaral LAN (2004) Modularity from fluctuations in random graphs and complex networks. Phys Rev E 70(2):025101(R)
Harik G (1999) Linkage learning via probabilistic modeling in the ECGA. IlliGAL Report No. 99010, University of Illinois at Urbana-Champaign, Urbana
Harik G, Lobo F, Goldberg DE (1998) The compact genetic algorithm. In: IEEE conference on evolutionary computation, (Piscataway, NJ), pp 523–528, IEEE Service Center
He D, Wang Z, Yang B, Zhou C (2009) Genetic algorithm with ensemble learning for detecting community structure in complex networks. In 4th International Conference on Computer Sciences and Convergence Information Technology (ICCIT 09), IEEE Press, pp 702–707
Jin D, Liu D, Yang B, Liu J, Baquero C, He D (2010) Ant colony optimization with Markov random walk for clustering in complex networks. In: Proceedings of the 15th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD’11), pp 123–134
Karrer B, Levina E, Newman MEJ (2008) Robustness of community structure in networks. Phys Rev E (Stat Nonlinear Soft Matter Phys) 77(4):046119
Krebs V (2008) A network of co-purchased books about US politics. http://www.orgnet.com/
Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110
Latapy M, Pons P (2005) Computing communities in large networks using random walks. Lect Notes Comput Sci 3733:284–293
Lehmann S, Hansen LK (2007) Deterministic modularity optimization. Eur Phys J B 60:83–88
Li S, Chen Y, Du H, Feldman MW (2010) A genetic algorithm with local search strategy for improved detection of community structure. Complexity 15:53–60
Liu X, Murata T (2009) Advanced modularity-specialized label propagation algorithm for detecting communities in networks. Phys A 389(7):1493
Liu Y, Luo J, Yang H, Liu L (2010) Finding closely communicating community based on ant colony clustering model. In: Proceedings of the 2010 International conference on artificial intelligence and computational intelligence (AICI’10), pp 127–131
Lusseau D (2003) The emergent properties of a dolphin social network. In. Proc. Biol. Sci. 270(Suppl 2):S186–S188
Newman MEJ (2006a) From the cover: modularity and community structure in networks. Proc. Natl. Acad. Sci. USA 103:8577–8582
Newman MEJ (2006b) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104
Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113
Ossa LDL, Sastry K, Lobo FG (2006) Extended compact genetic algorithm in C ++:Version 1.1. IlliGAL Report No. 2006013, University of Illinois at Urbana-Champaign, Urbana, IL
Palla G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435:814–818
Park YJ, Song MS (1989) A genetic algorithm for clustering problems. In: Proceedings of 3rd annual conference on genetic algorithms, pp 2–9
Pelikan M, Goldberg DE, Cantu-Paz E (1998) Linkage problem, distribution estimation, and Bayesian networks. IlliGAL Report No. 98013, University of Illinois at Urbana Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL
Pizzuti C (2008) GA-NET: a genetic algorithm for community detection in social networks. In: Proceedings of the 10th International Conference on Parallel Problem Solving from Nature PPSN, September 13–17, Dortmund, Germany, pp 1081–1090, LNCS 5189, Springer, Berlin
Pizzuti C (2009) A multi-objective genetic algorithm for community detection in networks. In: 21st IEEE international conference on tools with artificial intelligence (ICTAI 09), IEEE Press, pp 379–386
Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3):036106
Rosvall M, Bergstrom CT (2007) An information-theoretic framework for resolving community structure in complex networks. Proc Natl Acad Sci USA 104:7327–7331
Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci USA 105:1118–1123
Rosvall M, Bergstrom CT (2010) Mapping change in large networks. PLoS ONE 5(1):e8694
Rosvall M, Bergstrom CT (2011) Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems. PLoS ONE 6(4):e18209
Sadi S, Oguducu SG, Uyar AS (2010) An efficient community detection method using parallel clique-finding ants. In: Proceedings of IEEE congress on evolutionary computation (CEC’10), pp 1–7
Sastry K, Goldberg DE (2000) On Extended Compact Genetic Algorithm. IlliGAL Report No. 2000026, University of Illinois at Urbana-Champaign, Urbana, IL
Sastry K, Goldberg DE (2001) Modeling tournament selection with replacement using apparent added noise. IN: Intelligent engineering systems through artificial neural networks, 11, pp. 129–134. (Also IlliGAL Report No. 2001014)
Shi ZW, Liu Y, Liang JJ (2009) PSO-based community detection in complex networks. In: Proceedings of second international symposium on knowledge acquisition and modeling (KAM ‘09), vol 03, pp 114–119
Singh A, Baghel A (2009) A new grouping genetic algorithm approach to the multiple traveling salesperson problem. Soft Comput 13:95–101
Šubelj L, Bajec M (2011a) Unfolding communities in large complex networks: combining defensive and offensive label propagation for core extraction. Phys Rev E 83:036103
Šubelj L, Bajec M (2011b) Robust network community detection using balanced propagation. Eur Phys J B 81(3):353–362
Tan F, Fu X, Zhang Y, Bourgeois AG (2008) A genetic algorithm-based method for feature subset selection. Soft Comput 12:111–120
Tasgin M, Herdagdelen A, Bingol H (2007) Community detection in complex networks using genetic algorithms. eprint arXiv:0711.0491
Verma A (2010) Scaling simple, compact and extended compact genetic algorithms using mapreduce. Thesis for the degree of Master, University of Illinois at Urbana-Champaign
White JG, Southgate E, Thompson JN, Brenner S (1986) The structure of the nervous system of the nematode C. Elegans Phil Trans R Soc London 314:1–340
Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452–473
Acknowledgments
The authors would like to thank the anonymous reviewers for their constructive comments and suggestions which have led to great improvement on this paper, especially on the experiments including statistical significance test and convergence time evaluation. The authors are also grateful to the editors for checking the spelling and references carefully in this paper. This work is supported by the National Natural Science Foundation of China (No. 61132009, 61271374) and the Beijing Natural Science Foundation (No. 4122068).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, J., Song, Y. Community detection in complex networks using extended compact genetic algorithm. Soft Comput 17, 925–937 (2013). https://doi.org/10.1007/s00500-012-0942-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-012-0942-1