Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014 (2014), Article ID 580647, 9 pages
http://dx.doi.org/10.1155/2014/580647
Research Article

A Modularity Degree Based Heuristic Community Detection Algorithm

Software College, Northeastern University, Shenyang 110819, China

Received 11 October 2013; Revised 6 January 2014; Accepted 7 January 2014; Published 25 February 2014

Academic Editor: Yuncai Wang

Copyright © 2014 Dongming Chen 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. R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks,” Reviews of Modern Physics, vol. 74, no. 1, pp. 47–97, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. M. E. Newman, “The structure and function of complex networks,” SIAM Review, vol. 45, no. 2, pp. 167–256, 2003. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. S. H. Strogatz, “Exploring complex networks,” Nature, vol. 410, no. 6825, pp. 268–276, 2001. View at Publisher · View at Google Scholar · View at Scopus
  4. A. Lancichinetti and S. Fortunato, “Community detection algorithms: a comparative analysis,” Physical Review E, vol. 80, no. 5, Article ID 056117, 11 pages, 2009. View at Publisher · View at Google Scholar · View at Scopus
  5. M. Coscia, F. Giannotti, and D. Pedreschi, “A classification for community discovery methods in complex networks,” Statistical Analysis and Data Mining, vol. 4, no. 5, pp. 512–546, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. M. Girvan and M. E. 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 Zentralblatt MATH · View at Scopus
  7. K. Kumar and V. Jayaraman, “Clustering of complex networks and community detection using group search optimization,” 2013, http://arxiv.org/abs/1307.1372.
  8. A. Clauset, M. E. J. Newman, and C. Moore, “Finding community structure in very large networks,” Physical Review E, vol. 70, no. 6, Article ID 066111, 6 pages, 2004. View at Publisher · View at Google Scholar · View at Scopus
  9. Z. Li, S. Zhang, R.-S. Wang, X.-S. Zhang, and L. Chen, “Quantitative function for community detection,” Physical Review E, vol. 77, no. 3, Article ID 036109, 9 pages, 2008. View at Google Scholar
  10. A. Arenas, J. Duch, A. Fernández, and S. Gómez, “Size reduction of complex networks preserving modularity,” New Journal of Physics, vol. 9, article 176, 2007. View at Publisher · View at Google Scholar · View at Scopus
  11. M. E. Newman, “Fast algorithm for detecting community structure in networks,” Physical Review E, vol. 69, no. 6, Article ID 066133, 5 pages, 2004. View at Publisher · View at Google Scholar · View at Scopus
  12. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, “Fast unfolding of communities in large networks,” Journal of Statistical Mechanics, vol. 2008, no. 10, Article ID P10008, 2008. View at Publisher · View at Google Scholar · View at Scopus
  13. D. Chen, Y. Fu, and M. Shang, “A fast and efficient heuristic algorithm for detecting community structures in complex networks,” Physica A, vol. 388, no. 13, pp. 2741–2749, 2009. View at Publisher · View at Google Scholar · View at Scopus
  14. J. Duch and A. Arenas, “Community detection in complex networks using extremal optimization,” Physical Review E, vol. 72, no. 2, Article ID 027104, 4 pages, 2005. View at Publisher · View at Google Scholar · View at Scopus
  15. S. Fortunato and M. Barthélemy, “Resolution limit in community detection,” Proceedings of the National Academy of Sciences of the United States of America, vol. 104, no. 1, pp. 36–41, 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. A. Geyer-Schulz, M. Ovelgönne, and M. Stein, “Modified randomized modularity clustering: adapting the resolution limit,” in Algorithms from and for Nature and Life, Studies in Classification, Data Analysis, and Knowledge Organization, pp. 355–363, Springer, 2013. View at Google Scholar
  17. C. Granell, S. Gomez, and A. Arenas, “Hierarchical multiresolution method to overcome the resolution limit in complex networks,” International Journal of Bifurcation and Chaos, vol. 22, no. 7, 2012. View at Publisher · View at Google Scholar
  18. 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 Google Scholar
  19. D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson, “The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations,” Behavioral Ecology and Sociobiology, vol. 54, no. 4, pp. 396–405, 2003. View at Publisher · View at Google Scholar · View at Scopus
  20. E. Ravasz and A. L. Barabási, “Hierarchical organization in complex networks,” Physical Review E, vol. 67, no. 2, Article ID 026112, 7 pages, 2003. View at Google Scholar