Community detection via maximization of modularity and its variants

IEEE Transactions on Computational Social Systems

Volumn 1, Issue 1, 2014, Pages 46-65

  Chen, Mingming ^a   Kuzmin, Konstantin ^a   Szymanski, Boleslaw K ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Community detection; fine tuned; maximization; modularity

Indexed keywords

ALGORITHMS; OPTICAL VARIABLES MEASUREMENT; OPTIMIZATION; POPULATION DYNAMICS;

COMMUNITY DETECTION; COMMUNITY DETECTION ALGORITHMS; FINE-TUNED; MODULARITY; MODULARITY DENSITIES; NETWORK COMMUNITY STRUCTURES; QUALITY MEASUREMENTS; SPLITTING AND MERGING;

ITERATIVE METHODS;

EID: 84921060719     PISSN: None     EISSN: 2329924X     Source Type: Journal    
DOI: 10.1109/TCSS.2014.2307458     Document Type: Article

References (56)

1. M. E. J. Newman and M. Girvan, "Finding and evaluating community structure in networks," Phys. Rev. E, vol. 69, p. 026113, Feb. 2004.
2. S. Fortunato, "Community detection in graphs," Phys. Rep., vol. 486, pp. 75-174, 2010.
3. M. E. J. Newman, "Modularity and community structure in networks," in Proc. Nat. Acad. Sci., 2006, vol. 103, no. 23, pp. 8577-8582.
4. E. A. Leicht and M. E. J. Newman, "Community structure in directed networks," Phys. Rev. Lett., vol. 100, p. 118703, Mar. 2008.
5. M. E. J. Newman, "Analysis of weighted networks," Phys. Rev. E, vol. 70, p. 056131, Nov. 2004.
6. M. E. J. Newman, "Fast algorithm for detecting community structure in networks," Phys. Rev. E, vol. 69, p. 066133, Jun. 2004.
7. A. Clauset, M. E. J. Newman, and C. Moore, "Finding community structure in very large networks," Phys. Rev. E, vol. 70, p. 066111, Dec. 2004.
8. K. Wakita and T. Tsurumi, "Finding community structure in mega-scale social networks: [extended abstract]," in Proc. 16th Int. Conf. World Wide Web, New York, NY, USA, 2007, pp. 1275-1276.
9. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, "Fast unfolding of communities in large networks," J. Statist. Mech.: Theory Exp., vol. 2008, no. 10, p. P10008, 2008.
10. M. E. J. Newman, "Finding community structure in networks using the eigenvectors of matrices," Phys. Rev. E, vol. 74, p. 036104, Sep. 2006.
11. T. Richardson, P. J. Mucha, and M. A. Porter, "Spectral tripartitioning of networks," Phys. Rev. E, vol. 80, p. 036111, Sep. 2009.
12. S. White and P. Smyth, "A spectral clustering approach to finding communities in graph," in Proc. SIAM Int. Conf. Data Mining, Newport Beach, CA, USA, Apr. 2005, pp. 274-285.
13. J. Ruan and W. Zhang, "An efficient spectral algorithm for network community discovery and its applications to biological and social networks," in Proc. 7th IEEE Int. Conf. Data Mining, Washington, DC, USA, 2007, pp. 643-648.
14. J. Ruan and W. Zhang, "Identifying network communities with a high resolution," Phys. Rev. E, vol. 77, p. 016104, Jan. 2008.
15. M. E. J. Newman, "Spectral methods for network community detection and graph partitioning," Phys. Rev. E, vol. 88, p. 042822, 2013.
16. J. Duch and A. Arenas, "Community detection in complex networks using extremal optimization," Phys. Rev. E, vol. 72, p. 027104, Aug. 2005.
17. R. Guimerà and L. A. N. Amaral, "Functional cartography of complex metabolic networks," Nature, vol. 433, pp. 895-900, Feb. 2005.
18. R. Guimerà and L. A. N. Amaral, "Cartography of complex networks: Modules and universal roles," J. Statist. Mech.: Theory Exp., vol. 2005, no. 02, p. P02001, 2005.
19. C. P. Massen and J. P. K. Doye, "Identifying communities within energy landscapes," Phys. Rev. E, vol. 71, p. 046101, Apr. 2005.
20. A. Medus, G. Acüna, and C. Dorso, "Detection of community structures in networks via global optimization," Phys. A: Statist. Mech. Appl., vol. 358, no. 24, pp. 593-604, 2005.
21. M. Sales-Pardo, R. Guimerà, A. A. Moreira, and L. A. N. Amaral, "Extracting the hierarchical organization of complex systems," Proc. Nat. Acad. Sci. U. S. A., Sep. 2007, vol. 104, no. 39, pp. 15224-15229.
22. G. Agarwal and D. Kempe, "Modularity-maximizing graph communities via mathematical programming," Eur. Phys. J. B, vol. 66, no. 3, pp. 409-418, 2008.
23. M. Chen, T. Nguyen, and B. K. Szymanski, "On measuring the quality of a network community structure," in Proc. ASE/IEEE Int. Conf. Social Comput., Washington, DC, USA, Sep. 2013, pp. 122-127.
24. M. Chen, T. Nguyen, and B. K. Szymanski, "A new metric for quality of network community structure," ASE Hum. J., vol. 2, no. 4, pp. 226-240, 2013.
25. S. Fortunato and M. Barthèlemy, "Resolution limit in community detection," Proc. Nat. Acad. Sci., vol. 104, no. 1, pp. 36-41, 2007.
26. U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski et al., "On modularity clustering," IEEE Trans. Knowl. Data Eng., vol. 20, no. 2, pp. 172-188, Feb. 2008.
27. T. Chakraborty, S. Srinivasan,N. Ganguly, S. Bhowmick, andA.Mukherjee, "Constant communities in complex networks," Nature Scientific Reps. 3, May 2013, Art. No. 1825.
28. J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst, in Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, Z. Bai, Ed. Philadelphia, PA, USA: SIAM, 2000.
29. S. Boettcher and A. G. Percus, "Optimization with extremal dynamics," Phys. Rev. Lett., vol. 86, pp. 5211-5214, Jun. 2001.
30. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, no. 4598, pp. 671-680, May 1983.
31. H. Karloff, Linear Programming. Boston, MA, USA: Birkhäuser, 1991.
32. J. W. Berry, B. Hendrickson, R. A. LaViolette, and C. A. Phillips, "Tolerating the community detection resolution limit with edge weighting," Phys. Rev. E, vol. 83, p. 056119, May 2011.
33. S. Muff, F. Rao, and A. Caflisch, "Local modularity measure for network clusterizations," Phys. Rev. E, vol. 72, no. 5, p. 056107, 2005.
34. A. Arenas, A. Fernandez, and S. Gomez, "Analysis of the structure of complex networks at different resolution levels," New J. Phys., vol. 10, no. 5, p. 053039, 2008.
35. A. Lancichinetti and S. Fortunato, "Limits of modularity maximization in community detection," Phys. Rev. E, vol. 84, no. 6, p. 066122, 2011.
36. C. Granell, S. Gomez, and A. Arenas, "Hierarchical multiresolution method to overcome the resolution limit in complex networks," Int. J. Bifur. Chaos, vol. 22, p. 1250171, 2012.
37. Z. Li, S. Zhang, R.-S. Wang, X.-S. Zhang, and L. Chen, "Quantitative function for community detection," Phys. Rev. E, vol. 77, no. 3, p. 036109, 2008.
38. V. A. Traag, P. Van Dooren, and Y. Nesterov, "Narrow scope for resolutionlimit-free community detection," Phys. Rev. E, vol. 84, no. 1, p. 016114, 2011.
39. J. Reichardt and S. Bornholdt, "Partitioning and modularity of graphs with arbitrary degree distribution," Phys. Rev. E, vol. 76, p. 015102, Jul. 2007.
40. A. S. Waugh, L. Pei, J. H. Fowler, P. J. Mucha, and M. A. Porter, Party polarization in congress: A network science approach, Preprint, 2011 [Online]. Available: http://arxiv.org/abs/0907.3509.
41. N. Eagle, A. Pentland, and D. Lazer, "Inferring social network structure using mobile phone data," in Proc. Nat. Acad. Sci. (PNAS), 2009, vol. 106, no. 36, pp. 15274-15278.
42. Y.-C. Wei and C.-K. Cheng, "Towards efficient hierarchical designs by ratio cut partitioning," in Proc. IEEE Int. Conf. Comput. Aided Des., 1989, pp. 298-301.
43. M. Fiedler, "Algebraic connectivity of graphs," Czech. Math. J., vol. 23, pp. 298-305, 1973.
44. A. Pothen, H. D. Simon, and K.-P. Liou, "Partitioning sparse matrices with eigenvectors of graphs," SIAM J. Matrix Anal. Appl., vol. 11, no. 3, pp. 430-452, May 1990.
45. B. H. Good, Y.-A. de Montjoye, and A. Clauset, "Performance of modularity maximization in practical contexts," Phys. Rev. E, vol. 81, p. 046106, Apr. 2010.
46. L. Danon, A. Díaz-Guilera, J. Duch, and A. Arenas, "Comparing community structure identification," J. Statist. Mech.: Theory Exp., vol. 2005, no. 09, p. P09008, 2005.
47. S. Wagner and D. Wagner, "Comparing clusterings-An overview," Univ. Karlsruhe (TH), Karlsruhe, Germany, Tech. Rep. 2006-04, 2007.
48. S. Van Dongen, "Performance criteria for graph clustering and Markov cluster experiments," Nat. Res. Inst. Math. Comput. Sci., Amsterdam, The Netherlands, Tech. Rep., 2000.
49. W. M. Rand, "Objective criteria for the evaluation of clustering methods," J. Amer. Statist. Assoc., vol. 66, no. 336, pp. 846-850, 1971.
50. L. Hubert and P. Arabie, "Comparing partitions," J. Classification, vol. 2, no. 1, pp. 193-218, 1985.
51. A. Ben-Hur, A. Elisseeff, and I. Guyon, "A stability based method for discovering structure in clustered data," in Proc. Pacific Symp. BIOCOMPUTING, 2001, pp. 6-17.
52. W. Zachary, "An information flow model for conflict and fission in small groups," J. Anthropol. Res., vol. 33, pp. 452-473, 1977.
53. M. Girvan and M. E. J. Newman, "Community structure in social and biological networks," Proc. Nat. Acad. Sci., vol. 99, no. 12, pp. 7821-7826, 2002.
54. M. Boguñá, R. Pastor-Satorras, A. Díaz-Guilera, and A. Arenas, "Models of social networks based on social distance attachment," Phys. Rev. E, vol. 70, p. 056122, Nov. 2004.
55. M. Bastian, S. Heymann, and M. Jacomy, "Gephi: An open source software for exploring and manipulating networks," in Proc. Int. AAAI Conf. Weblogs and Social Media (ICWSM), San Jose, CA, USA, May 2009, pp. 361-362.
56. A. Lancichinetti, S. Fortunato, and F. Radicchi, "Benchmark graphs for testing community detection algorithms," Phys. Rev. E, vol. 78, p. 046110, Oct. 2008.