Identifying and evaluating community structure in complex networks

Pattern Recognition Letters

Volumn 31, Issue 5, 2010, Pages 413-421

  Steinhaeuser, Karsten ^a   Chawla, Nitesh V ^a  

^a University of Notre Dame   (United States)

Author keywords

Community detection; Complex networks; Evaluation metrics; Random walks; Scalability; Social networks

Indexed keywords

COMMUNITY DETECTION; COMPLEX NETWORKS; EVALUATION METRICS; RANDOM WALK; RANDOM WALKS; SOCIAL NETWORKS;

COMPUTATIONAL COMPLEXITY; SCALABILITY;

POPULATION DYNAMICS;

EID: 75149140809     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2009.11.001     Document Type: Article

References (24)

1. Asur, S., Ucar, D., Parthasarathy, S., 2007. An ensemble framework for clustering protein-protein interaction. In: Proc. ISMB.
2. Brandes U., Delling D., Gaertler M., et al. On finding graph clusterings with maximum modularity. LNCS vol. 4769 (2007), Springer, Berlin, Heidelberg pp. 121-132
3. Clauset A., Newman M., and Moore C. Finding community structure in very large networks. Phys. Rev. E 70 (2004) 066111
4. Donetti L., and Muñoz M. Detecting network communities: A new systematic and efficient algorithm. J. Stat. Mech. Theor. Exp. (2004) P10012
5. Duch J., and Arenas A. Community detection in complex networks using extremal optimization. Phys. Rev. E 72 (2005) 027104
6. Enright A.J., Van Dongen S., and Ouzounis C.A. An efficient algorithm for large-scale detection of protein families. Nucl. Acids Res. 30 7 (2002) 1575-1584
7. Fred, A., Jain, A., 2002. Data clustering using evidence accumulation. In: Proc. ICPR.
8. Fred, A., Jain, A., 2003. Robust data clustering. In: Proc. CVPR.
9. Fortunato S., and Barthélemy M. Resolution limit in community detection. Proc. Natl. Acad. Sci. USA 104 1 (2007) 36-41
10. Girvan M., and Newman M. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99 (2002) 7821-7826
11. Hubert L., and Arabie P. Comparing partitions. J. Classif. 2 1 (1985) 193-218
12. Johnson S. Hierarchical clustering schemes. Psychometrika 32 3 (1967) 241-254
13. Madey G., Barabási A.-L., Chawla N.V., et al. Enhanced situational awareness: Application of DDDAS concepts to emergency and disaster management. LNCS vol. 4487 (2007), Springer, Berlin, Heidelberg pp. 1090-1097
14. Milligan G., and Cooper M. A study of the comparability of external criteria for hierarchical cluster analysis. Multivar. Behav. Res. 21 4 (1986) 441-458
15. Newman M., and Girvan M. Finding and evaluating community structure in networks. Phys. Rev. E 69 (2004) 026113
16. Pons P., and Latapy M. Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10 2 (2006) 191-218
17. Rand W. Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66 336 (1971) 846-850
18. Reichardt J., and Bornholdt S. Statistical mechanics of community detection. Phys. Rev. E 74 (2006) 016110
19. Ruan, J., Zhang, W., 2007. An efficient spectral algorithm for network community discovery and its applications to biological and social networks. In: Proc. ICDM.
20. Sokal R., and Sneath P. Principles of Numerical Taxonomy (1963), W.H. Freeman and Co., San Francisco
21. Steinhaeuser K., and Chawla N.V. Community detection in a large real-world social network. In: Liu H., et al. (Ed). Social Computing, Behavioral Modeling, and Prediction (2008), Springer, US 168-175
22. van Dongen, S., 2000. Graph Clustering by Flow Simulation, Ph.D. Thesis, University of Utrecht, Netherlands.
23. Wasserman S., and Faust K. Social Network Analysis: Methods and Applications (1994), Cambridge University Press
24. Zachary W.W. An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33 4 (1977) 452-473