Comparative evaluation of community detection algorithms: A topological approach

Journal of Statistical Mechanics: Theory and Experiment

Volumn 2012, Issue 8, 2012, Pages

  Orman, Günce Keziban ^a,b   Labatut, Vincent ^a   Cherifi, Hocine ^b  

^a GALATASARAY UNIVERSITY   (Turkey)

^b UNIVERSITÉ DE BOURGOGNE   (France)

Author keywords

clustering techniques; network dynamics; network reconstruction; networks; random graphs

Indexed keywords

EID: 84866321659     PISSN: None     EISSN: 17425468     Source Type: Journal    
DOI: 10.1088/1742-5468/2012/08/P08001     Document Type: Article

References (34)

1. da Fontura Costa L, Oliveira O N Jr, Travieso G, Rodrigues R A, Villas Boas P R, Antiqueira L, Viana M P and da Rocha L E C 2008 Analyzing and Modeling real-world phenomena with complex networks: a survey of applications arXiv:0711.3199 [physics.soc-ph]
2. Fortunato S 2010 Community detection in graphs Phys. Rep. 486 75
3. Newman M E J and Girvan M 2004 Finding and evaluating community structure in networks Phys. Rev. E 69 026113
4. Lancichinetti A, Kivelä M, Saramäki J and Fortunato S 2010 Characterizing the community structure of complex networks PLoS ONE 5 e11976
5. Palla G, Derenyi I, Farkas I and Vicsek T 2005 Uncovering the overlapping community structure of complex networks in nature and society Nature 435 814 (Pubitemid 40839731)
6. Girvan M and Newman M E J 2002 Community structure in social and biological networks Proc. Nat. Acad. Sci. 99 7821 (Pubitemid 34650963)
7. Lancichinetti A, Fortunato S and Radicchi F 2008 Benchmark graphs for testing community detection algorithms Phys. Rev. E 78 046110
8. Danon L, Diaz-Guilera A and Arenas A 2006 The effect of size heterogeneity on community identification in complex networks J. Stat. Mech. P11010
9. Leskovec J, Lang K J, Dasgupta A and Mahoney M W 2008 Statistical properties of community structure in large social and information networks Proc. 17th Int. Conf. on World Wide Web pp 695-704
10. Wolpert D H and Macready W G 1995 No Free Lunch Theorems for Search Santa Fe Institute
11. Newman M E J 2003 The structure and function of complex networks SIAM Rev. 45 167
12. Guimerà R, Danon L, Díaz-Guilera A, Giralt F and Arenas A 2003 Self-similar community structure in a network of human interactions Phys. Rev. E 68 065103
13. Orman G K and Labatut V 2010 The effect of network realism on community detection algorithms ASONAM (Odense, Denmark) (London: IEEE Computer Society) pp 301-5
14. Orman G K and Labatut V 2009 A comparison of community detection algorithms on artificial networks 12th Int. Conf. on Discovery Science (Lect. Notes Comput. Sci.) 5808 242
15. Rand W M 1971 Objective criteria for the evaluation of clustering methods J. Am. Stat. Assoc. 66 846
16. Hubert L and Arabie P 1985 Comparing partitions J. Classif. 2 193
17. Fred A L N and Jain A K 2003 Robust data clustering IEEE Computer Society Conf. on Computer Vision and Pattern Recognition (Los Alamitos, CA: IEEE Computer Society) pp 128-36
18. Danon L, Díaz-Guilera A, Duch J and Arenas A 2005 Comparing community structure identification J. Stat. Mech. P09008
19. Danon L, Duch J, Arenas A and Díaz-Guilera A 2007 Community structure identification Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science (Singapore: World Scientific) pp 93-113
20. Newman M E J 2006 Modularity and community structure in networks Proc. Nat. Acad. Sci. USA 103 8577 (Pubitemid 43878062)
21. Newman M E J 2004 Fast algorithm for detecting community structure in networks Phys. Rev. E 69 066133
22. Blondel V D, Guillaume J-L, Lambiotte R and Lefebvre E 2008 Fast unfolding of communities in large networks J. Stat. Mech. P10008
23. Gan G, Ma C and Wu J 2007 Data Clustering: Theory, Algorithms, and Applications (Philadelphia, PA: Society for Industrial and Applied Mathematics)
24. Pons P and Latapy M 2005 Computing communities in large networks using random walks 20th Int. Symp. on Computer and Information Sciences (Lect. Notes Comput. Sci.) 3733 284
25. Rosvall M and Bergstrom C T 2007 An information-theoretic framework for resolving community structure in complex networks Proc. Nat. Acad. Sci. USA 104 7327 (Pubitemid 47185904)
26. Rosvall M and Bergstrom C T 2008 Maps of random walks on complex networks reveal community structure Proc. Nat. Acad. Sci. 105 1118 (Pubitemid 351397014)
27. Lancichinetti A, Radicchi F, Ramasco J and Fortunato S 2011 Finding statistically significant communities in networks PLoS ONE 6 e18961
28. Raghavan U N, Albert R and Kumara S 2007 Near linear time algorithm to detect community structures in large-scale networks Phys. Rev. E 76 036106 (Pubitemid 47443121)
29. Gregory S 2010 Finding overlapping communities in networks by label propagation New J. Phys. 12 103018
30. van Dongen S 2008 Graph clustering via a discrete uncoupling process SIAM J. Matrix Anal. Appl. 30 121
31. Molloy M and Reed B 1995 A critical point for random graphs with a given degree sequence Random Struct. Algorithms 6 161
32. Orman G K, Labatut V and Cherifi H 2011 Qualitative comparison of community detection algorithms Int. Conf. on Digital Information and Communication Technology and its Applications (DICTAP) 167 ed H Cherifi (Berlin: Springer) pp 265-79
33. Bagrow J P 2008 Evaluating local community methods in networks J. Stat. Mech. P05001
34. Guimerà R and Amaral L A N 2005 Functional cartography of complex metabolic networks Nature 433 895 (Pubitemid 40314902)