Exploring the limits of community detection strategies in complex networks

Scientific Reports

Volumn 3, Issue , 2013, Pages

  Aldecoa, Rodrigo ^a   Marín, Ignacio ^a  

^a INSTITUTO DE BIOMEDICINA DE VALENCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84880352454     PISSN: None     EISSN: 20452322     Source Type: Journal    
DOI: 10.1038/srep02216     Document Type: Article

References (38)

1. Dorogovtsev, S. N. & Mendes, J. F. F. Evolution of Networks: From Biological Nets to the Internet and WWW.(Oxford University Press: 2003).
2. Newman, M. E. J. Networks: An Introduction. (Oxford University Press: 2010).
3. Fortunato, S. Community detection in graphs. Phys. Rep. 486, 75-174 (2010).
4. Aldecoa, R. & Mar, I. Deciphering Network Community Structure by Surprise. PLoS ONE 6, e24195 (2011).
5. Aldecoa, R. & Mar, I. Closed benchmarks for network community structure characterization. Phys. Rev. E 85, 026109 (2012).
6. Aldecoa, R. &Mar, I. Surprise maximization reveals the community structure of complex networks. Sci. Rep. 3, 1060 (2013).
7. Danon, L., Duch, J., Diaz-Guilera, A. & Arenas, A. Comparing community structure identification. J. Stat. Mech. P09008 (2005).
8. Lancichinetti, A. &Fortunato, S. Community detection algorithms: a comparative analysis. Phys. Rev. E 80, 056117 (2009).
9. Orman, G. K., Labatut, V. & Cherifi, H. On accuracy of community structure discovery algorithms. J Convergence Inform Technol 6, 283 (2011).
10. Orman, G. K., Labatut, V. & Cherifi, H. Comparative evaluation of community detection algorithms: a topological approach. J. Stat. Mech. P08001 (2012).
11. Lancichinetti, A., Radicchi, F., Ramasco, J. J. & Fortunato, S. Finding statistically significant communities in networks. PloS ONE 6, e18961 (2011).
12. Girvan, M. & Newman, M. E. J. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821 (2002).
13. Fortunato, S. & Barthe?emy, M. Resolution limit in community detection. Proc. Natl. Acad. USA 104, 36 (2007).
14. Lancichinetti, A. & Fortunato, S. Limits of modularity maximization in community detection. Phys. Rev. E 84, 066122 (2011).
15. Xiang, J. & Hu, K. Limitation of multi-resolution methods in community detection. Physica A 121, 587-616 (2012).
16. Lancichinetti, A., Fortunato, S. & Radicchi, F. Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78, 046110 (2008).
17. Watts, D. J. Small worlds. The dynamics of networks between order and randomness. (Princeton University Press: 1999).
18. Meila, M. Comparing clusterings-an information based distance. J. Multivariate Anal. 98, 873 (2007).
19. Newman, M. E. J. & Girvan, M. Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004).
20. Rosvall, M.& Bergstrom, C. T.Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. USA 105, 1118 (2008).
21. Reichardt, J. & Bornholdt, S. Statistical mechanics of community detection. Phys. Rev. E 74, 16110 (2006).
22. Raghavan, U. N., Albert, R. & Kumara, S. Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76, 036106 (2007).
23. Enright, A. J., van Dongen, S. & Ouzounis, C. A. An efficient algorithm for largescale detection of protein families. Nucl. Acid Res. 30, 1575-1584 (2002). (Pubitemid 34679732)
24. Ronhovde, P. & Nussinov, Z. Local resolution-limit-free Potts model for community detection. Phys. Rev. E 81, 046114 (2010).
25. Traag, V. A., Van Dooren, P. & Nesterov, Y. Narrow scope for resolution-free community detection. Phys. Rev. E 84, 016114 (2011).
26. E, W., Li, T. & Vanden-Eijnden, E. Optimal partition and effective dynamics of complex networks. Proc. Natl. Acad. Sci. USA 105, 7907-7912 (2008). (Pubitemid 351904680)
27. Schuetz, P. & Caflisch, A. Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. Phys. Rev. E 77, 046112 (2008).
28. Clauset, A., Newman, M. E. J. & Moore, C. Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004).
29. Aldecoa, R. & Mar, I. Jerarca: Efficient Analysis of Complex Networks Using Hierarchical Clustering. PloS ONE 5, e11585 (2010).
30. King, A. D., Przulj, N. & Jurisica, I. Protein complex prediction via cost-based clustering. Bioinformatics 20, 3013-3020 (2004). (Pubitemid 39619193)
31. Arnau, V.,Mars, S.&Mar, I. Iterative cluster analysis of protein interaction data. Bioinformatics 21, 364-378 (2005). (Pubitemid 40246608)
32. Pielou, E. C. The measurement of diversity in different types of biological collections. J. Theor. Biol. 13, 131-144 (1966).
33. Sokal, R. R. & Michenner, C. D. A statistical method for evaluating systematic relationships. Univ. Kansas Sci. Bull. 38, 1409-1438 (1958).
34. Blondel, V. D., Guillaume, J.-L., Lambiotte, R. & Lefebvre, E. Fast unfolding of communities in large networks. J. Stat. Mech. P10008 (2008).
35. Donetti, L. & Muñoz, M. A. Detecting Network Communities: a new systematic and efficient algorithm. J. Stat. Mech. P10012 (2004).
36. Duch, J. & Arenas, A. Community detection in complex networks using extremal optimization. Phys. Rev. E 72, 027104 (2005).
37. Park, Y. & Bader, J. S. Resolving the structure of interactomes with hierarchical agglomerative clustering. BMC Bioinformatics 12, S44 (2011).
38. Pons, P. & Latapy, M. Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10, 191-218 (2006).