Community extraction for social networks

Proceedings of the National Academy of Sciences of the United States of America

Volumn 108, Issue 18, 2011, Pages 7321-7326

  Zhao, Yunpeng ^a   Levina, Elizaveta ^a   Zhu, Ji ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; COMMUNITY STRUCTURE; COMPUTER SIMULATION; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; SOCIAL NETWORK; STOCHASTIC MODEL;

ALGORITHMS; INFORMATION SERVICES; MODELS, THEORETICAL; SOCIAL SUPPORT; STOCHASTIC PROCESSES;

EID: 79956327022     PISSN: 00278424     EISSN: 10916490     Source Type: Journal    
DOI: 10.1073/pnas.1006642108     Document Type: Article

References (37)

1. Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103:8577-8582.
2. Goldenberg A, Zheng AX, Fienberg SE, Airoldi EM (2009) A survey of statistical network models. Found Trends Mach Learn 2:129-233.
3. Fortunato S (2010) Community detection in graphs. Phys Rep 486:75-174.
4. Palla G, Derenyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435:814-818. (Pubitemid 40839731)
5. Airoldi EM, Blei DM, Fienberg SE, Xing EP (2008) Mixed membership stochastic blockmodels. J Mach Learn Res 9:1981-2014.
6. Newman MEJ (2004) Detecting community structure in networks. Eur Phys J B 38:321-330.
7. Wei Y-C, Cheng C-K (1989) Toward efficient hierarchical designs by ratio cut partitioning. Proceedings of the IEEE International Conference on Computer Aided Design (IEEE, New York), pp 298-301.
8. Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE T Pattern Anal 22:888-905.
9. Ng A, Jordan M, Weiss Y (2001) On spectral clustering: Analysis and an algorithm. Neural Information Processing Systems 14, eds T Dietterich, S Becker, and Z Ghahramani (MIT Press, Cambridge, MA), pp 849-856.
10. Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113.
11. Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99:7821-7826. (Pubitemid 34650963)
12. Hunter DR, Goodreau SM, Handcock MS (2008) Goodness of fit of social network models. J Am Stat Assoc 103:248-258.
13. Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96) (AAAI Press, Menlo Park, CA), pp 226-231.
14. Hinneburg A, Keim DA (1998) An efficient approach to clustering in large multimedia databases with noise. Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD-98) (AAAI Press, Menlo Park, CA), pp 58-65.
15. Holland PW, Laskey KB, Leinhardt S (1983) Stochastic blockmodels: first steps. Soc Networks 5:109-137.
16. Snijders T, Nowicki K (1997) Estimation and prediction for stochastic block-structures for graphs with latent block structure. J Classif 14:75-100.
17. Nowicki K, Snijders TAB (2001) Estimation and prediction for stochastic blockstructures. J Am Stat Assoc 96:1077-1087.
18. Newman MEJ, Leicht EA (2007) Mixture models and exploratory analysis in networks. Proc Natl Acad Sci USA 104:9564-9569. (Pubitemid 47175306)
19. Hoff PD, Raftery AE, Handcock MS (2002) Latent space approaches to social network analysis. J Am Stat Assoc 97:1090-1098.
20. Handcock MD, Raftery AE, Tantrum JM (2007) Model-based clustering for social networks. J R Stat Soc A-G 170:301-354.
21. Hoff PD (2007) Modeling homophily and stochastic equivalence in symmetric relational data. Advances in Neural Information Processing Systems, (MIT Press, Cambridge, MA), Vol 19.
22. Karrer B, Newman MEJ (2011) Stochastic blockmodels and community structure in networks. Phys Rev E 83:016107.
23. Borgatti SP, Everett MG (2000) Models of core/periphery structures. Soc Networks 21:375-395.
24. Everett MG, Borgatti SP (2000) Peripheries of cohesive subsets. Soc Networks 21:397-407.
25. Flake GM, Lawrence S, Giles CL, Coetzee FM (2002) Self-organization and identification of web communities. IEEE Computer 35:66-71.
26. Clauset A (2005) Finding local community structure in networks. Phys Rev E 72:026132.
27. Clauset A, Moore C, Newman MEJ (2008) Hierarchical structure and the prediction of missing links in networks. Nature 453:98-101.
28. Frank O, Strauss D (1986) Markov graphs. J Am Stat Assoc 81:832-842.
29. Bickel PJ, Chen A (2009) A nonparametric view of network models and Newman-Girvan and other modularities. Proc Natl Acad Sci USA 106:21068-21073.
30. Beasley JE (1998) Heuristic algorithms for the unconstrained binary quadratic programming problem. Technical report, Management School, Imperial College, London, UK.
31. Glover FW, Lagunas M (1997) Tabu Search (Kluwer Academic, Boston).
32. Bickel PJ, Doksum KA (2007) Mathematical Statistics: Basic Ideas and Selected Topics, (Pearson Prentice Hall, Upper Saddle River, NJ), 2nd Ed, Vol 1.
33. Tibshirani R, Walther G, Hastie T (2001) Estimating the number of clusters in a dataset via the gap statistic. J R Stat Soc A 63:411-423.
34. Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74:036104.
35. Hubert L, Arabie P (1985) Comparing partitions. J Classif 2(1):193-218.
36. Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452-473.
37. Karrer B, Levina E, Newman MEJ (2008) Robustness of community structure in networks. Phys Rev E 77:046119.