Sampling community structure

Proceedings of the 19th International Conference on World Wide Web, WWW '10

Volumn , Issue , 2010, Pages 701-710

  Maiya, Arun S ^a   Berger Wolf, Tanya Y ^a  

^a University of Illinois at Chicago   (United States)

Author keywords

clustering; community detection; complex networks; graphs; sampling; social networks

Indexed keywords

COMMUNITY DETECTION; COMMUNITY STRUCTURES; COMPLEX NETWORKS; EXPANDER GRAPHS; IN-NETWORK; LARGER NETWORKS; NOVEL METHODS; REAL-WORLD DATASETS; SAMPLING METHOD; SOCIAL NETWORKS; STATISTICAL RELATIONAL LEARNING; SUBGRAPHS;

CIRCUIT THEORY; DATA PROCESSING; POPULATION DYNAMICS; SOCIAL NETWORKING (ONLINE);

WORLD WIDE WEB;

EID: 77954604479     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1772690.1772762     Document Type: Conference Paper

References (34)

1. M. Adler and M. Mitzenmacher. Towards compressing web graphs. In Proc. of the IEEE DCC, pages 203-212, 2000.
2. M. Boguna, R. P. Satorras, A. D. Guilera, and A. Arenas. Models of social networks based on social distance attachment. Physical Review E, 70(5), 2004.
3. E. Bullmore and O. Sporns. Complex brain networks: graph theoretical analysis of structural and functional systems. Nature reviews. Neuroscience, Feb 2009.
4. B. A. Cipra. The best of the 20th century: Editors name top 10 algorithms. SIAM News, 33, 2000.
5. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70(6):066111+, Dec 2004.
6. R. Clayford and T. Johnson. Operational parameters affecting use of anonymous cell phone tracking for generating traffic information. In 82nd TRB Annual Meeting, Jan 2003.
7. D. Crandall, D. Cosley, D. Huttenlocher, J. Kleinberg, and S. Suri. Feedback effects between similarity and social influence in online communities. In KDD '08, pages 160-168, 2008.
8. L. Danon, A. Díaz-Guilera, J. Duch, and A. Arenas. Comparing community structure identification. J. Stat. Mech.: Theory and Experiment, 2005(09):P09008+, Sep 2005.
9. J. Duch and A. Arenas. Community detection in complex networks using extremal optimization. Physical Review E, 72(2):027104+, 2005.
10. T. Feder and R. Motwani. Clique partitions, graph compression and speeding-up algorithms. In J. Comp. and Sys. Sci., pages 123-133, 1991.
11. S. Fortunato. Community detection in graphs. Jun 2009.
12. O. Frank. Network Sampling and Model Fitting. Cambridge University Press, February 2005.
13. J. Gehrke, P. Ginsparg, and J. Kleinberg. Overview of the 2003 kdd cup. SIGKDD Explor. Newsl., 5(2):149-151, 2003.
14. A. C. Gilbert and K. Levchenko. Compressing network graphs. In Proc. LinkKDD workshop at the 10th ACM Conference on KDD, Aug 2004.
15. M. Girvan and M. E. Newman. Community structure in social and biological networks. Proc Natl Acad Sci USA, 99(12):7821-7826, Jun 2002. (Pubitemid 34650963)
16. S. Goel, Matthew, and J. Salganik. Respondent-driven sampling as markov chain monte carlo. Stat. in Medicine, 2009.
17. B. H. Good, Y.-A. de Montjoye, and A. Clauset. The performance of modularity maximization in practical contexts. arXiv ePrints, 0910.0165, 2009.
18. D. Gusfield. Partition-distance: A problem and class of perfect graphs arising in clustering. Info. Proc. Letters, 82(3):159-164, May 2002.
19. S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bull. Amer. Math. Soc., 43:439-561, 2006.
20. C. Hubler, H.-P. Kriegel, K. Borgwardt, and Z. Ghahramani. Metropolis algorithms for representative subgraph sampling. In ICDM '08, pages 283-292, 2008.
21. H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A. L. Barabási. The large-scale organization of metabolic networks. Nature, 407(6804):651-654, Oct 2000.
22. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. J. ACM, 51(3):497-515, May 2004.
23. J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins. Microscopic evolution of social networks. In KDD '08, pages 462-470, 2008.
24. J. Leskovec and C. Faloutsos. Sampling from large graphs. In KDD '06, pages 631-636, New York, NY, USA, 2006.
25. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD '05, pages 177-187, 2005.
26. D. J. C. Mackay. Information Theory, Inference & Learning Algorithms. Cambridge University Press, Jun 2002.
27. S. A. Macskassy and F. Provost. Classification in networked data: A toolkit and a univariate case study. J. Mach. Learn. Res., 8:935-983, 2007.
28. A. Mehler and S. Skiena. Expanding network communities from representative examples. ACM TKDD, 3(2):1-27, 2009.
29. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculations by fast computing machines. J. Chem. Phys., 21(6):1087-92, 1953.
30. M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74(3), 2006.
31. D. Rafiei. Effectively visualizing large networks through sampling. In Proc. VIS 05, pages 375-382, 2005.
32. M. Richardson, R. Agrawal, and P. Domingos. Trust Management for the Semantic Web, volume 2870. January 2003.
33. S. Wasserman, K. Faust, and D. Iacobucci. Social Network Analysis : Methods and Applications. Cambridge University Press, Nov 1994.
34. W. Zachary. An information flow model for conflict and fission in small groups. J. Anthropological Research, 33:452-473, 1977.