An improved memetic algorithm for community detection in complex networks

2012 IEEE Congress on Evolutionary Computation, CEC 2012

Volumn , Issue , 2012, Pages

  Gong, Maoguo ^a   Cai, Qing ^a   Li, Yangyang ^a   Ma, Jingjing ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

community detection; elitism strategy; label propagation; memetic algorithm; simulated annealing

Indexed keywords

COMMUNITY DETECTION; COMPLEX NETWORKS; ELITISM STRATEGY; IMPROVE-A; LABEL PROPAGATION; LOCAL SEARCH; MEMETIC ALGORITHMS; MULTI-RESOLUTIONS; REAL-WORLD NETWORKS;

POPULATION DYNAMICS; SIMULATED ANNEALING;

EVOLUTIONARY ALGORITHMS;

EID: 84866848763     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2012.6252971     Document Type: Conference Paper

References (60)

1. Newman, M. E. J. (2001) The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences 98 (2): 404-409.
2. Albert, R., Jeong, H. & Barabási, A.-L. (1999) Diameter of the World- Wide Web. Nature (London) 401, 130-131.
3. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A. & Wiener, J. (2000) Graph structure in the web. Comput. Networks 33, 309-320.
4. Watts, D. J. & Strogatz, S. H. (1998) Collective dynamics of 'smallworld' networks. Nature (London) 393, 440-442.
5. Williams, R. J. & Martinez, N. D. (2000) Simple rules yield complex food webs. Nature (London) 404, 180-183.
6. Jeong,H., Tombor, B., Albert, R.,Oltvai, Z. N. & Barabási, A.-L. (2000) The large scale organization of metabolic networks. Nature (London) 407, 651-654.
7. Fell, D. A. & Wagner, A. (2000) The small world of metabolism. Nat. Biotechnol. 18, 1121-1122.
8. Wasserman, S. & Faust, K. (1994) Social Network Analysis. Cambridge University Press, Nov 25, page 825.
9. Scott, J. (2000) Social Network Analysis: A Handbook, 2nd Ed. Newberry Park, CA: Sage. ISBN 0-7619-6338-3
10. Pool, I. de S. & Kochen, M. (1978) Contacts and influence. Social Networks 1, pp. 1-48.
11. Milgram, S. (1967) The Small World Problem. Psychol. Today 2, pp. 60-67.
12. Barabási, A.-L. & Albert, R. (1999) Emergance of scaling in random networks. Science 286, 509-512.
13. Krapivsky, P. L., Redner, S. & Leyvraz, F. (2000) Connectivity of growing random networks. Phys. Rev. Lett. 85, 4629-4632.
14. Dorogovtsev, S. N., Mendes, J. F. F. & Samukhin, A. N. (2000) Structure of growing networks: Exact solution of the Barabasi-Albert model. Phys. Rev. Lett. 85, 4633-4636.
15. Newman, M. E. J., Strogatz, S. H. & Watts, D. J. (2001) Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118.
16. Redner, S. (1998) How Popular is Your Paper? An Empirical Study of the Citation Distribution. Eur. Phys. J. B 4, 131-134.
17. Menger, K. (1927) Zur Allgemeinen kurventheorie. Fundamenta Mathematicae 10, 96-115.
18. White, D. R. & Harary, F. (2001) The cohesiveness of blocks in social networks. Sociol. Methodol. 31, 305-359.
19. Ahuja, R. K., Magnanti, T. L. & Orlin, J. B. (1993) Network Flows: Theory, Algorithms, and Applications Prentice-Hall, Upper Saddle River, NJ, USA. ISBN 0-13-617549-X.
20. Katz, L. (1953) A new status index derived from sociometric analysis. Psychometrika 18, 39-43.
21. Freeman, L. (1977) A set of measures of centrality based on betweenness. Sociometry 40, 35-41.
22. Newman, M. E. J. (2001) Scientific collaboration networks: I. Network construction and fundamental results. Phys. Rev. E 64, 016131.
23. Newman, M. E. J. (2004) Fast algorithm for dtecting community structure in network. Phys. Rev. E, 69(6):066133.
24. Arenas, A. and Diaz-Guilera, A. (2007) Synchronization and modularity in complex networks. European Physical Journal ST, 143:19-25.
25. Clauset, A., Newman, M. E. J., Moore, C. (2004) Finding community structure in very large networks. Physical Review E 70, 066111.
26. Lozano, S., Duch, J., and Arenas, A. (2007) Analysis of large social datasets by community detection. European Physical Journal ST, 143:257-259.
27. Newman, M. E. J. and Girvan, M. (2004) Finding and evaluating community structure in networks. Physical Review E, 69:026113.
28. Clara Pizzuti. (2008) Ga-net: a genetic algorithm for community detection in social networks. In Proc. of the 10th International Conference on Parallel Problem Solving from Nature (PPSN 2008), pages 1081-1090.
29. Filippo Radicchi, Claudio Castellano, Federico Cecconi, Vittorio Loreto, and Domenico Parisi. (2004) Defining and identifying communities in networks. Proc. Natl. Acad. Sci. USA (PNAS'04), 101(9):2658-2663.
30. Mursel Tasgin, Amac Herdagdelen, and Haluk Bingol. (2007) Communities detection in complex networks using genetic algorithms. oai:arXiv.org:0711. 0491v1 [physics.soc-ph].
31. Santo Fortunato and Claudio Castellano. (2007) Community structure in graphs. arXiv:0712.2716v1 [physics.soc-ph].
32. Girvan, M. and Newman, M. E. J. (2002) Community structure in social and biological networks. In Proc. National. Academy of Science. USA 99, pages 7821-7826.
33. Roger Guimerà, Marta Sales-Pardo, and Luís A. Nunes Amaral. (Aug 2004) Modularity from fluctuations in random graphs and complex networks. Phys. Rev. E, 70(2):025101.
34. Jordi Duch and Alex Arenas. (Aug 2005) Community detection in complex networks using extremal optimization. Phys. Rev. E, 72(2):027104.
35. Xin Liu, Deyi Li, Shuliang Wang, and Zhiwei Tao. (2007) Effective algorithm for detecting community structure in complex networks based on ga and clustering. In Computational Science. ICCS 2007, volume 4488 of Lecture Notes in Computer Science, pages 657-664. Springer Berlin /Heidelberg.
36. Santo Fortunato and Marc Barthélemy. (2007) Resolution limit in community detection. Proceedings of the National Academy of Sciences, 104(1):36-41.
37. Zhenping Li, Shihua Zhang, Rui-Sheng Wang, Xiang-Sun Zhang, and Luonan Chen. (Mar 2008) Quantitative function for community detection. Phys. Rev. E, 77(3):036109.
38. Maoguo Gong, Bao Fu, Licheng Jiao. (2011) Memetic algorithm for community detection in networks. Physical Review E, 84, 056101.
39. Dawkins, R. (1989) The selfish gene. New York: Oxford University Press.
40. Pablo Moscato and Carlos Cotta. (2003) A gentle introduction to memetic algorithms. In Fred Glover and Gary Kochenberger,editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, pages 105-144. Springer New York.
41. Krasnogor, N. and Smith, J. (Oct. 2005) A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Transactions on Evolutionary Computation, 9(5):474-488.
42. Yels, A. and Wattenberg, M. (1994) Stochastic hill climbing as a baseline method for evaluating genetic algorithms. Technical report, No. UCB/CSD-94-834. University of California, Berkeley.
43. Kirkpatrick, S.; Gelatt, C. D.; Vecchi, M. P. (1983). Optimization by Simulated Annealing. Science 220 (4598): 671-680. doi:10.1126/science.220.4598. 671. JSTOR 1690046. PMID 17813860.
44. Černý, V. (1985). Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications 45: 41-51. doi:10.1007/BF00940812.
45. Metropolis, Nicholas; Rosenbluth, Arianna W.; Rosenbluth, Marshall N.; Teller, Augusta H.; Teller, Edward (1953) Equation of State Calculations by Fast Computing Machines. The Journal of Chemical Physics 21 (6): 1087. doi:10.1063/1.1699114.
46. Granville, V.; Krivanek, M.; Rasson, J.-P. (1994) Simulated annealing: A proof of convergence. IEEE Transactions on Pattern Analysis and Machine Intelligence 16 (6): 652-656. doi:10.1109/34.295910.
47. Glover, F. and McMillan, C. (1986) The general employee scheduling problem: an integration of MS and AI. Computers and Operations Research, 13, 563-573.
48. Fred Glover. (1989) Tabu Search - Part 1. ORSA Journal on Computing 1 (2): 190-206.
49. Fred Glover. (1990) Tabu Search - Part 2. ORSA Journal on Computing 2 (1): 4-32.
50. Dhillon, I. S., Guan, Y. and Kulis, B. (2004) In Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, New York), pp. 551-556.
51. Angelini, L., Boccaletti, S., Marinazzo, D., Pellicoro, M. and Stramaglia, S. (2007) Chaos 17, 023114.
52. Bagrow, J. and Bollt, E. (2005) A local method for detecting communities. Phys. Rev. E, vol. 72, p. 046108, 2005.
53. White, D. R. & Harary, F. (2001) Sociol. Methodol. 31, 305-359.
54. Albert, R., Raghavan, U. and Kumara, S. (2007) Near linear time algorithm to detect community structures in large scale networks. Phys. Rev. E 76, 036106.
55. F. Wu and B. A. Huberman. (2004) Finding communities in linear time: a physics approach. Eur. Phys. J. B, vol. 38, p. 331.
56. Leon Danon, Albert Díaz-Guilera, Jordi Duch, and Alex Arenas. (2005) Comparing community structure identification. Journal of Statistical Mechanics: Theory and Experiment, 2005(09):P09008.
57. Andrea Lancichinetti, Santo Fortunato, and Filippo Radicchi. (2008) New benchmark in community detection. arXiv:0805.4770v2 [physics.soc-ph].
58. Zachary, W. W. (1977) An information flow model for conflict and fission in small groups. Journal of anthropological research, pages 452-473.
59. David Lusseau, Karsten Schneider, Oliver J. Boisseau, Patti Haase, Elisabeth Slooten, and Steve M. Dawson. (2003) The bottlenose dolphin community of doubtful sound features a large proportion of longlasting associations. Behavioral Ecology and Sociobiology, 54:396-405.
60. Newman, M. E. J. (2005) Modularity and Community Structure in Networks. In Proceedings of the National Academy of Sciences, pp. 8577-8582.