Relative evaluation of partition algorithms for complex networks

2009 1st International Conference on Networked Digital Technologies, NDT 2009

Volumn , Issue , 2009, Pages 20-25

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

^a GALATASARAY UNIVERSITY   (Turkey)

^b SCIENTIFIC AND TECHNOLOGICAL RESEARCH COUNCIL OF TURKEY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

BETWEENNESS; COMPLEX NETWORKS; EIGENVECTORS; GENERATIVE MODEL; LABEL PROPAGATION; MARKOV CLUSTERING; NORMALIZED MUTUAL INFORMATION; PARTITION ALGORITHMS; REAL NETWORKS; RESEARCH TOPICS;

BIOLOGY; CONTENT BASED RETRIEVAL; FLUORINE CONTAINING POLYMERS;

CLUSTERING ALGORITHMS;

EID: 70450190934     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NDT.2009.5272078     Document Type: Conference Paper

References (24)

1. M. E. J. Newman, "The structure and function of complex networks," SIAM Review, vol. 45, pp. 167-256, 2003.
2. M. E. J. Newman and M. Girvan, "Finding and evaluating community structure in networks," Physical Review E, vol. 69, p. 026113, 2004.
3. 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, pp. 7821-7826, Jun 11 2002.
4. T. Falkowski, A. Barth, and M. Spiliopoulou, "DENGRAPH: A Density-based Community Detection Algorithm," in IEEE/WIC/ACM International Conference on Web Intelligence, 2007, pp. 112-115.
5. Y. Liu, Q. Wang, Q. Wang, Q. Yao, and Y. Liu, "Email Community Detection Using Artificial Ant Colony Clustering," in Advances in Web and Network Technologies, and Information Management Berlin / Heidelberg: Springer, 2007, pp. 287-298.
6. P. Hoff, A. Raftery, and M. Handcock, "Latent space approaches to social network analysis," Journal of the American Statistical Association, vol. 97, pp. 1090-1098, 2002.
7. M. E. J. Newman, "Fast algorithm for detecting community structure in networks," Physical Review E, vol. 69, p. 066133, Jun 2004.
8. U. N. Raghavan, R. Albert, and S. Kumara, "Near linear time algorithm to detect community structures in large-scale networks," Phys. Rev. E, vol. 76, p. 036106, 2007.
9. P. Pons and M. Latapy, "Computing communities in large networks using random walks," Computer and Information Sciences - Iscis 2005, Proceedings, vol. 3733, pp. 284-293, 2005.
10. J. Reichardt and S. Bornholdt, "Detecting Fuzzy Community Structures in Complex Networks with a Potts Model," Physical Review Letters, vol. 93, p. 218701, 2004.
11. L. Danon, A. Diaz-Guilera, and A. Arenas, "The effect of size heterogeneity on community identification in complex networks," Journal of Statistical Mechanics-Theory and Experiment, p. 11010, Nov 2006.
12. A. Lancichinetti, S. Fortunato, and F. Radicchi, "Benchmark graphs for testing community detection algorithms," Phys Rev E Stat Nonlin Soft Matter Phys, vol. 78, p. 046110, Oct 2008.
13. A. L. N. Fred and A. K. Jain, "Robust Data Clustering," in IEEE Computer Society Conference on Computer Vision and Pattern Recognition. vol. 2: IEEE Computer Society, 2003, pp. 128-136.
14. L. Danon, A. Díaz-Guilera, J. Duch, and A. Arenas, "Comparing community structure identification," J. Stat. Mech., p. P09008, 2005.
15. A. Clauset, M. E. J. Newman, and C. Moore, "Finding community structure in very large networks," Physical Review E, vol. 70, p. 066111, 2004.
16. M. E. J. Newman, "Finding community structure in networks using the eigenvectors of matrices," Phys. Rev. E, vol. 74, p. 036104, 2006.
17. J. Reichardt and S. Bornholdt, "Statistical mechanics of community detection," Phys. Rev. E, vol. 74, p. 016110, 2006.
18. S. van Dongen, "Graph clustering by flow simulation." vol. PhD Utrecht: University of Utrecht, Netherlands, 2000.
19. I. Derenyi, G. Palla, and T. Vicsek, "Clique percolation in random networks," Physical Review Letters, vol. 94, Apr 29 2005.
20. P. Erdos and A. Renyi, "On random graphs," Publicationes Mathematicae, vol. 6, pp. 290-297, 1959.
21. M. Molloy and B. Reed, "A critical point for random graphs with a given degree sequence," Random Structures and Algorithms, vol. 6, pp. 161-179, 1995.
22. A. Barabasi and R. Albert, "Statistical mechanics of complex networks," Reviews of Modern physics, vol. 74, pp. 47-96, 2002.
23. R. Guimerà, M. Sales-Pardo, and L. A. N. Amaral, "Modularity from fluctuations in random graphs and complex networks," Physical Review E, vol. 70, p. 025101, 2004.
24. A.-L. Barabási and R. Albert, "Emergence of Scaling in Random Networks," Science, vol. 286, pp. 509-512, 1999.