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

Performance Evaluation of Modularity Based Community Detection Algorithms in Large Scale Networks

1Department of Computer Science, Federal University of São João del Rei (UFSJ), 36301-360 São João del Rei, MG, Brazil
2COPPE, Federal University of Rio de Janeiro (UFRJ), P.O. Box 68506, 21941-972 Rio de Janeiro, RJ, Brazil

Received 28 August 2014; Accepted 27 November 2014; Published 28 December 2014

Academic Editor: Mohamed A. Seddeek

Copyright © 2014 Vinícius da Fonseca Vieira 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. 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, 2004. View at Publisher · View at Google Scholar · View at Scopus
  2. S. Fortunato, “Community detection in graphs,” Physics Reports, vol. 486, no. 3–5, pp. 75–174, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. R. Guimerà and L. A. N. Amaral, “Functional cartography of complex metabolic networks,” Nature, vol. 433, no. 7028, pp. 895–900, 2005. View at Publisher · View at Google Scholar · View at Scopus
  4. Y. I. Leon-Suematsu and K. Yuta, “Framework for fast identification of community structures in large-scale social networks,” in Data Mining for Social Network Data, vol. 12 of Annals of Information Systems, pp. 149–175, Springer, New York, NY, USA, 2010. View at Google Scholar
  5. J. Leskovec, K. J. Lang, and M. Mahoney, “Empirical comparison of algorithms for network community detection,” in Proceedings of the 19th International World Wide Web Conference (WWW '10), pp. 631–640, ACM, New York, NY, USA, April 2010. View at Publisher · View at Google Scholar · View at Scopus
  6. M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 69, no. 2, Article ID 026113, 2004. View at Publisher · View at Google Scholar · View at Scopus
  7. J. Yang and J. Leskovec, “Defining and evaluating network communities based on ground-truth,” in Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics (MDS '12), vol. 3, pp. 1–8, ACM, Beijing, China, 2012.
  8. F. Moradi, T. Olovsson, and P. Tsigas, “An evaluation of community detection algorithms on large- scale email traffic,” in Experimental Algorithms, R. Klasing, Ed., vol. 7276 of Lecture Notes in Computer Science, pp. 283–294, Springer, Berlin, Germany, 2012. View at Google Scholar
  9. 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
  10. 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 Scopus
  11. L. C. Freeman, “Centrality in social networks conceptual clarification,” Social Networks, vol. 1, no. 3, pp. 215–239, 1978. View at Publisher · View at Google Scholar · View at Scopus
  12. M. E. J. Newman, “Fast algorithm for detecting community structure in networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 69, no. 6, Article ID 066133, 2004. View at Publisher · View at Google Scholar · View at Scopus
  13. G. Agarwal and D. Kempe, “Modularity-maximizing graph communities via mathematical programming,” European Physical Journal B, vol. 66, no. 3, pp. 409–418, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  14. J. Duch and A. Arenas, “Community detection in complex networks using extremal optimization,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 72, no. 2, Article ID 027104, 2005. View at Publisher · View at Google Scholar · View at Scopus
  15. M. E. J. Newman, “Modularity and community structure in networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 103, no. 23, pp. 8577–8582, 2006. View at Publisher · View at Google Scholar · View at Scopus
  16. F. R. K. Chung, Spectral Graph Theory, American Mathematical Society, 1996.
  17. 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
  18. B. H. Good, Y.-A. de Montjoye, and A. Clauset, “Performance of modularity maximization in practical contexts,” Physical Review E, vol. 81, no. 4, Article ID 046106, 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. A. Lancichinetti and S. Fortunato, “Limits of modularity maximization in community detection,” Physical Review E, vol. 84, no. 6, Article ID 066122, 2011. View at Publisher · View at Google Scholar · View at Scopus
  20. P. Ronhovde and Z. Nussinov, “Multiresolution community detection for megascale networks by information-based replica correlations,” Physical Review E, vol. 80, no. 1, Article ID 016109, 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. R. Guimerà, M. Sales-Pardo, and L. A. N. Amaral, “Modularity from fluctuations in random graphs and complex networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 70, no. 2, Article ID 025101, 2004. View at Publisher · View at Google Scholar · View at Scopus
  22. A. Kehagias, “Bad communities with high modularity,” Computing Research Repository abs/1209.2678, 2012. View at Google Scholar
  23. S. Cafieri, P. Hansen, and L. Liberti, “Improving heuristics for network modularity maximization using an exact algorithm,” Discrete Applied Mathematics, vol. 163, part 1, pp. 65–72, 2014. View at Publisher · View at Google Scholar
  24. L. Danon, A. Diaz-Guilera, and A. Arenas, “Effect of size heterogeneity on community identification in complex networks,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2006, Article ID P11010, 2006. View at Publisher · View at Google Scholar
  25. H. Li, H. Jiang, R. Barrio, X. Liao, L. Cheng, and F. Su, “Incremental manifold learning by spectral embedding methods,” Pattern Recognition Letters, vol. 32, no. 10, pp. 1447–1455, 2011. View at Publisher · View at Google Scholar · View at Scopus
  26. M. E. Newman, “Finding community structure in networks using the eigenvectors of matrices,” Physical Review E, vol. 74, no. 3, Article ID 036104, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. V. da Fonseca Vieira and A. G. Evsukoff, “A comparison of methods for community detection in large scale networks,” Studies in Computational Intelligence, vol. 424, pp. 75–86, 2013. View at Publisher · View at Google Scholar · View at Scopus
  28. K. Wakita and T. Tsurumi, “Finding community structure in mega-scale social networks,” Analysis, vol. 105, no. 2, article 9, 2007. View at Google Scholar
  29. 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, Article ID P10008, 2008. View at Publisher · View at Google Scholar
  30. M. E. J. Newman, Networks: An Introduction, Oxford University Press, Oxford, UK, 1st edition, 2010.
  31. A. Lancichinetti, S. Fortunato, and J. Kertész, “Detecting the overlapping and hierarchical community structure in complex networks,” New Journal of Physics, vol. 11, Article ID 033015, 2009. View at Publisher · View at Google Scholar · View at Scopus
  32. A. Clauset, M. E. J. Newman, and C. Moore, “Finding community structure in very large networks,” Physical Review E, vol. 70, Article ID 066111, 2004. View at Publisher · View at Google Scholar · View at Scopus
  33. M. E. J. Newman, “Coauthorship networks and patterns of scientific collaboration,” Proceedings of the National Academy of Sciences of the United States of America, vol. 101, no. 1, pp. 5200–5205, 2004. View at Publisher · View at Google Scholar · View at Scopus
  34. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” The Bell System Technical Journal, vol. 49, no. 1, pp. 291–307, 1970. View at Publisher · View at Google Scholar
  35. S. Balay, J. Brown, K. Buschelman et al., “PETSc users manual,” Tech. Rep. ANL-95/11-Revision 3.3, Argonne National Laboratory, 2012. View at Google Scholar
  36. Y. Saad, Iterative Methods for Sparse Linear Systems, Society for Industrial and Applied Mathematics, 2nd edition, 2003.
  37. M. T. Heath, Scientific Computing: An Introductory Survey, McGraw-Hill, New York, NY, USA, 2nd edition, 2002.
  38. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, vol. 2, The MIT Press, 2001.