Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017 (2017), Article ID 4143638, 12 pages
https://doi.org/10.1155/2017/4143638
Research Article

Heuristic Artificial Bee Colony Algorithm for Uncovering Community in Complex Networks

1College of Computer Science and Technology, Jilin University, Changchun 130012, China
2Computer & Electrical Engineering and Computer Science Department, Florida Atlantic University, Boca Raton, FL 33431, USA
3School of Management Science and Information Engineering, Jilin University of Finance and Economics, Changchun 130117, China
4Department of Applied Mathematics, Changchun University of Science and Technology, Changchun 130022, China

Correspondence should be addressed to Xiongfei Li; nc.ude.ulj@iefgnoix

Received 21 July 2016; Revised 23 October 2016; Accepted 17 November 2016; Published 18 January 2017

Academic Editor: Mauro Gaggero

Copyright © 2017 Yuquan Guo et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. J. Watts, P. S. Dodds, and M. E. J. Newman, “Identity and search in social networks,” Science, vol. 296, no. 5571, pp. 1302–1305, 2002. View at Publisher · View at Google Scholar · View at Scopus
  2. L. Royer, M. Reimann, A. F. Stewart, and M. Schroeder, “Network compression as a quality measure for protein interaction networks,” PLoS ONE, vol. 7, no. 6, Article ID e35729, 2012. View at Publisher · View at Google Scholar · View at Scopus
  3. D. Gibson, J. Kleinberg, and P. Raghavan, “Inferring web communities from link topology,” in Proceedings of the 9th ACM Conference On Hypertext And Hypermedia: Links, Objects, Time and Space—Structure in Hypermedia Systems: Links, Objects, Time and Space—Structure in Hypermedia Systems, pp. 225–234, Pittsburgh, Pa, USA, 1998. View at Publisher · View at Google Scholar
  4. S. Fortunato and C. Castellano, “Community structure in graphs,” in Computational Complexity, pp. 490–512, Springer, New York, NY, USA, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. G. K. Orman, V. Labatut, and H. Cherifi, “Comparative evaluation of community detection algorithms: a topological approach,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2012, no. 8, Article ID P08001, 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. A. Lancichinetti and S. Fortunato, “Community detection algorithms: a comparative analysis,” Physical Review E, vol. 80, no. 5, Article ID 056117, 2009. View at Publisher · View at Google Scholar
  7. B. Yang, D.-Y. Liu, J. Liu, D. Jin, and H.-B. Ma, “Complex network clustering algorithms,” Journal of Software, vol. 20, no. 1, pp. 54–66, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. Q. Cai, L. Ma, M. Gong, and D. Tian, “A survey on network community detection based on evolutionary computation,” International Journal of Bio-Inspired Computation, vol. 8, no. 2, pp. 84–98, 2016. View at Publisher · View at Google Scholar · View at Scopus
  9. M. E. J. Newman, “Communities, modules and large-scale structure in networks,” Nature Physics, vol. 8, no. 1, pp. 25–31, 2012. View at Publisher · View at Google Scholar · View at Scopus
  10. H. W. Shen, X. Q. Cheng, K. Cai, and M.-B. Hu, “Detect overlapping and hierarchical community structure in networks,” Physica A: Statistical Mechanics and Its Applications, vol. 388, no. 8, pp. 1706–1712, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. G. Palla, I. Derényi, I. Farkas, and T. Vicsek, “Uncovering the overlapping community structure of complex networks in nature and society,” Nature, vol. 435, no. 7043, pp. 814–818, 2005. View at Publisher · View at Google Scholar · View at Scopus
  12. M.-S. Shang, D.-B. Chen, and T. Zhou, “Detecting overlapping communities based on community cores in complex networks,” Chinese Physics Letters, vol. 27, no. 5, Article ID 058901, 2010. View at Publisher · View at Google Scholar · View at Scopus
  13. C. Yin, S. Zhu, H. Chen, B. Zhang, and B. David, “A method for community detection of complex networks based on hierarchical clustering,” International Journal of Distributed Sensor Networks, vol. 2015, Article ID 849140, 9 pages, 2015. View at Publisher · View at Google Scholar
  14. M. Girvan and M. E. J. Newman, “Community structure in social and biological networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 99, no. 12, pp. 7821–7826, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. J. R. Tyler, D. M. Wilkinson, and B. A. Huberman, “E-mail as spectroscopy: automated discovery of community structure within organizations,” The Information Society, vol. 21, no. 2, pp. 143–153, 2005. View at Publisher · View at Google Scholar · View at Scopus
  16. F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Paris, “Defining and identifying communities in networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 101, no. 9, pp. 2658–2663, 2004. View at Publisher · View at Google Scholar · View at Scopus
  17. X.-Q. Cheng and H.-W. Shen, “Uncovering the community structure associated with the diffusion dynamics on networks,” Journal of Statistical Mechanics-Theory and Experiment, vol. 2010, no. 4, Article ID P04024, 2010. View at Publisher · View at Google Scholar · View at Scopus
  18. M. Rosvall and C. T. Bergstrom, “Maps of random walks on complex networks reveal community structure,” Proceedings of the National Academy of Sciences of the United States of America, vol. 105, no. 4, pp. 1118–1123, 2008. View at Publisher · View at Google Scholar · View at Scopus
  19. D. Jin, B. Yang, C. Baquero, D. Y. Liu, D. X. He, and J. Liu, “A Markov random walk under constraint for discovering overlapping communities in complex networks,” Journal of Statistical Mechanics-Theory and Experiment, vol. 2011, no. 5, Article ID P05031, 2011. View at Publisher · View at Google Scholar
  20. U. N. Raghavan, R. Albert, and S. Kumara, “Near linear time algorithm to detect community structures in large-scale networks,” Physical Review E, vol. 76, no. 3, Article ID 036106, 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. H. Lou, S. Li, and Y. Zhao, “Detecting community structure using label propagation with weighted coherent neighborhood propinquity,” Physica A: Statistical Mechanics and Its Applications, vol. 392, no. 14, pp. 3095–3105, 2013. View at Publisher · View at Google Scholar · View at Scopus
  22. Y. Jiang, C. Jia, and J. Yu, “An efficient community detection method based on rank centrality,” Physica A: Statistical Mechanics and Its Applications, vol. 392, no. 9, pp. 2182–2194, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. S. Gregory, “Finding overlapping communities in networks by label propagation,” New Journal of Physics, vol. 12, Article ID 103018, 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. Z.-H. Wu, Y.-F. Lin, S. Gregory, H.-Y. Wan, and S.-F. Tian, “Balanced multi-label propagation for overlapping community detection in social networks,” Journal of Computer Science and Technology, vol. 27, no. 3, pp. 468–479, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. C. Lee, F. Reid, A. McDaid, and N. Hurley, “Detecting highly overlapping community structure by greedy clique expansion,” https://arxiv.org/abs/1002.1827.
  26. L. Danon, A. Diaz-Guilera, J. Duch, and A. Arenas, “Comparing community structure identification,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2005, no. 9, Article ID P09008, 2005. View at Google Scholar
  27. K. Steinhaeuser and N. V. Chawla, “Identifying and evaluating community structure in complex networks,” Pattern Recognition Letters, vol. 31, no. 5, pp. 413–421, 2010. View at Publisher · View at Google Scholar · View at Scopus
  28. H.-W. Shen, X.-Q. Cheng, and J.-F. Guo, “Quantifying and identifying the overlapping community structure in networks,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2009, no. 7, Article ID P07042, 2009. View at Publisher · View at Google Scholar · View at Scopus
  29. M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E, vol. 69, no. 2, Article ID 026113, 2004. View at Publisher · View at Google Scholar · View at Scopus
  30. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, “Fast unfolding of communities in large networks,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2008, no. 10, Article ID P10008, 2008. View at Publisher · View at Google Scholar · View at Scopus
  31. J. Duch and A. Arenas, “Community detection in complex networks using extremal optimization,” Physical Review E, vol. 72, no. 2, Article ID 027104, 2005. View at Publisher · View at Google Scholar · View at Scopus
  32. S. Lehmann and L. K. Hansen, “Deterministic modularity optimization,” The European Physical Journal B, vol. 60, no. 1, pp. 83–88, 2007. View at Publisher · View at Google Scholar · View at Scopus
  33. U. Brandes, D. Delling, M. Gaertler et al., “On finding graph clusterings with maximum modularity,” in Proceedings of the 33rd International Conference on Graph-Theoretic Concepts in Computer Science (WG '07), Lecture Notes in Computer Science, pp. 121–132, Dornburg, Germany, 2007.
  34. U. Brandes, D. Delling, M. Gaertler et al., “On modularity clustering,” IEEE Transactions on Knowledge & Data Engineering, vol. 20, no. 2, pp. 172–188, 2008. View at Publisher · View at Google Scholar · View at Scopus
  35. M. E. J. Newman, “Community detection in networks: modularity optimization and maximum likelihood are equivalent,” Physical Review E, vol. 94, no. 5, Article ID 052315, 2016. View at Publisher · View at Google Scholar
  36. U. Brandes, D. Delling, M. Gaertler et al., “On modularity clustering,” IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 2, pp. 172–188, 2008. View at Publisher · View at Google Scholar · View at Scopus
  37. R. Shang, J. Bai, L. Jiao, and C. Jin, “Community detection based on modularity and an improved genetic algorithm,” Physica A: Statistical Mechanics and its Applications, vol. 392, no. 5, pp. 1215–1231, 2013. View at Publisher · View at Google Scholar · View at Scopus
  38. Z. Wu, Y. Lin, H. Wan, S. Tian, and K. Hu, “Efficient overlapping community detection in huge real-world networks,” Physica A: Statistical Mechanics and Its Applications, vol. 391, no. 7, pp. 2475–2490, 2012. View at Publisher · View at Google Scholar · View at Scopus
  39. C. Pizzuti, “A multiobjective genetic algorithm to find communities in complex networks,” IEEE Transactions on Evolutionary Computation, vol. 16, no. 3, pp. 418–430, 2012. View at Publisher · View at Google Scholar · View at Scopus
  40. Y.-Q. Guo, X.-F. Li, and X. Liu, “Heuristic genetic algorithm associated with spectral analysis uncovering multi-scale community of complex networks,” Journal of Jilin University (Engineering and Technology Edition), vol. 45, no. 5, pp. 1592–1600, 2015. View at Publisher · View at Google Scholar · View at Scopus
  41. H. Duan and Q. Luo, “New progresses in swarm intelligence-based computation,” International Journal of Bio-Inspired Computation, vol. 7, no. 1, pp. 26–35, 2015. View at Publisher · View at Google Scholar · View at Scopus
  42. X. Zhou, Y. Liu, J. Zhang, T. Liu, and D. Zhang, “An ant colony based algorithm for overlapping community detection in complex networks,” Physica A: Statistical Mechanics and Its Applications, vol. 427, pp. 289–301, 2015. View at Publisher · View at Google Scholar · View at Scopus
  43. J. Ji, X. Song, C. Liu, and X. Zhang, “Ant colony clustering with fitness perception and pheromone diffusion for community detection in complex networks,” Physica A: Statistical Mechanics and Its Applications, vol. 392, no. 15, pp. 3260–3272, 2013. View at Publisher · View at Google Scholar · View at Scopus
  44. L. Ben Romdhane, Y. Chaabani, and H. Zardi, “A robust ant colony optimization-based algorithm for community mining in large scale oriented social graphs,” Expert Systems with Applications, vol. 40, no. 14, pp. 5709–5718, 2013. View at Publisher · View at Google Scholar · View at Scopus
  45. D. Karaboga, “An idea based on honey bee swarm for numerical optimization,” Tech. Rep. tr06, Erciyes University, Engineering Faculty, Computer Engineering Department, 2005. View at Google Scholar
  46. C. Bron and J. Kerbosch, “Algorithm 457: finding all cliques of an undirected graph,” Communications of the ACM, vol. 16, no. 9, pp. 575–577, 1973. View at Publisher · View at Google Scholar · View at Scopus
  47. A. Lancichinetti, S. Fortunato, and F. Radicchi, “Benchmark graphs for testing community detection algorithms,” Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, vol. 78, no. 4, Article ID 046110, 2008. View at Publisher · View at Google Scholar · View at Scopus
  48. W. W. Zachary, “An information flow model for conflict and fission in small groups,” Journal of Anthropological Research, vol. 33, no. 4, pp. 452–473, 1977. View at Publisher · View at Google Scholar
  49. D. Lusseau, “The emergent properties of a dolphin social network,” Proceedings of the Royal Society B: Biological Sciences, vol. 270, no. 2, pp. S186–S188, 2003. View at Publisher · View at Google Scholar · View at Scopus
  50. V. Krebs, 2014, http://www.orgnet.com.