Abstract
Network community detection is one of the most fundamental problems in network structure analytics. With the modularity and modularity density being put forward, network community detection is formulated as a single-objective optimization problem and then communities of network can be discovered by optimizing modularity or modularity density. However, the community detection by optimizing modularity or modularity density is NP-hard. The computational intelligence algorithm, especially for evolutionary single-objective algorithms, have been effectively applied to discover communities from networks. This chapter focuses on evolutionary single-objective algorithms for solving network community discovery. First this chapter reviews evolutionary single-objective algorithm for network community discovery. Then three representative algorithms and their performances of discovering communities are introduced in detail.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Acknowledgement: Reprinted from Applied Soft Computing, 19, Ma, L., Gong, M., Liu, J., Cai, Q., Jiao, L., Multi-level learning based memetic algorithm for community detection, 121–133, Copyright (2014), with permission from Elsevier.
- 2.
Acknowledgement: Reprinted from Information Science, 316, Cai, Q., Gong, M., Ma, L., Ruan, S., Yuan, F., Jiao, L., Greedy discrete particle swarm optimization for large-scale social network clustering, 503-516, Copyright(2015), with permission from Elsevier.
References
Bagrow, J.P., Bollt, E.M.: Local method for detecting communities. Phys. Rev. E 72(4), 046,108 (2005)
Barber, M.J., Clark, J.W.: Detecting network communities by propagating labels under constraints. Phys. Rev. E 80(2), 026,129 (2009)
Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. 2008(10), P10,008 (2008)
Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comp. 11(6), 4135–4151 (2011)
Cai, Q., Gong, M., Ma, L., Ruan, S., Yuan, F., Jiao, L.: Greedy discrete particle swarm optimization for large-scale social network clustering. Inf. Sci. 316, 503–516 (2015)
Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066,111 (2004)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Clifford stein. Introduction to algorithms (2001)
Danon, L., Diaz-Guilera, A., Duch, J., Arenas, A.: Comparing community structure identification. J. Stat. Mech.: Theory Exp. 2005(09), P09,008 (2005)
Fortunato, S., Barthelemy, M.: Resolution limit in community detection. Proc. Nat. Acad. Sci. 104(1), 36–41 (2007)
Gach, O., Hao, J.K.: A memetic algorithm for community detection in complex networks. In: International Conference on Parallel Problem Solving from Nature, pp. 327–336. Springer (2012)
Gong, M., Cai, Q., Chen, X., Ma, L.: Complex network clustering by multiobjective discrete particle swarm optimization based on decomposition. IEEE Trans. Evol. Comput. 18(1), 82–97 (2014)
Gong, M., Cai, Q., Li, Y., Ma, J.: An improved memetic algorithm for community detection in complex networks. In: 2012 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8. IEEE (2012)
Gong, M., Fu, B., Jiao, L., Du, H.: Memetic algorithm for community detection in networks. Phys. Rev. E 84(5), 056,101 (2011)
Gong, M., Ma, L., Zhang, Q., Jiao, L.: Community detection in networks by using multiobjective evolutionary algorithm with decomposition. Physica A: Stat. Mech. App. 391(15), 4050–4060 (2012)
Jain, B.J., Obermayer, K.: Elkans k-means algorithm for graphs. In: Mexican International Conference on Artificial Intelligence, pp. 22–32 (2010)
Kennedy, J.: Particle swarm optimization. In: Encyclopedia of Machine Learning, pp. 760–766. Springer (2011)
Li, Z., Zhang, S., Wang, R.S., Zhang, X.S., Chen, L.: Quantitative function for community detection. Phys. Rev. E 77(3), 036,109 (March 2008)
Ma, L., Gong, M., Liu, J., Cai, Q., Jiao, L.: Multi-level learning based memetic algorithm for community detection. Appl. Soft Comput. 19, 121–133 (2014)
Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026,113 (2004)
Ong, Y.S., Lim, M.H., Chen, X.: Memetic computationłpast, present & future [research frontier]. IEEE Comput. Intell. Mag. 5(2), 24–31 (2010)
Pizzuti, C.: Ga-net: a genetic algorithm for community detection in social networks. In: International Conference on Parallel Problem Solving from Nature, pp. 1081–1090 (2008)
Pizzuti, C.: A multiobjective genetic algorithm to find communities in complex networks. IEEE Trans. Evol. Comput. 16(3), 418–430 (2012)
Rosvall, M., Axelsson, D., Bergstrom, C.T.: The map equation. Eur. Phys. J. Spec. Top. 178(1), 13–23 (2009)
Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. Nat. Acad. Sci. 105(4), 1118–1123 (2008)
Shang, R., Bai, J., Jiao, L., Jin, C.: Community detection based on modularity and an improved genetic algorithm. Phys. A: Stat. Mech. Appl. 392(5), 1215–1231 (2013)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Gong, M., Cai, Q., Ma, L., Wang, S., Lei, Y. (2017). Network Community Discovery with Evolutionary Single-Objective Optimization. In: Computational Intelligence for Network Structure Analytics. Springer, Singapore. https://doi.org/10.1007/978-981-10-4558-5_2
Download citation
DOI: https://doi.org/10.1007/978-981-10-4558-5_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-4557-8
Online ISBN: 978-981-10-4558-5
eBook Packages: Computer ScienceComputer Science (R0)