Detecting community kernels in large social networks

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2011, Pages 784-793

  Wang, Liaoruo ^a   Lou, Tiancheng ^b   Tang, Jie ^b   Hopcroft, John E ^a  

^a Department of Obstetrics Gynecology   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Auxiliary communities; Community kernel detection; Community kernels; Social networks

Indexed keywords

CARDINALITIES; COMMUNITY KERNELS; COMMUNITY STRUCTURES; EFFICIENT ALGORITHM; OPTIMIZATION FRAMEWORK; PERFORMANCE IMPROVEMENTS; SOCIAL BEHAVIOR; SOCIAL NETWORKS; STATE-OF-THE-ART ALGORITHMS; WIKIPEDIA;

ALGORITHMS; DATA MINING;

SOCIAL NETWORKING (ONLINE);

EID: 84863116764     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2011.48     Document Type: Conference Paper

References (38)

1. S. Wu, J. M. Hofman, W. A. Mason, and D. J. Watts. Who says what to whom on twitter. In WWW, 2011.
2. M. E. J. Newman. Fast algorithm for detecting community structure in networks. Phys. Rev. E, 69(066133), 2004.
3. V. Pareto. Manual of political economy. New York: A. M. Kelly, 1971.
4. M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E, 74(036104), 2006.
5. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20:359-392, 1998.
6. R. Andersen, F. Chung, and K. Lang. A flow-based method for improving the expansion or conductance of graph cuts. In IPCO, 2004.
7. M. Rosvall and C. T. Bergstrom. An information-theoretic framework for resolving community structure in complex networks. Proc. Natl. Acad. Sci. USA, 104(18):7327-7331, 2007.
8. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using pagerank vectors. In FOCS, 2006.
9. S. White and P. Smyth. A spectral clustering approach to finding communities in graphs. In SDM, 2005.
10. N. Mishra, R. Schreiber, I. Stanton, and R. E. Tarjan. Finding stronglyknit clusters in social networks. Internet Mathematics, 5(1-2), 2009.
11. J. He, J. E. Hopcroft, H. Liang, S. Supasorn, and L. Wang. Detecting the structure of social networks using (α, β)-communities. In Proc. 8th Workshop on Algorithms and Models for the Web Graph (WAW), 2011.
12. C. X. Lin, B. Zhao, Q. Mei, and J. Han. Pet: a statistical model for popular events tracking in social communities. In KDD, 2010.
13. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Phys. Rev. E, 70(06111), 2004.
14. J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney. Statistical properties of community structure in large social and information networks. In WWW, 2008.
15. Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann. Link communities reveal multiscale complexity in networks. Nature, 466:761-764, 2010.
16. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of community hierarchies in large networks. J. Stat. Mach., 10(P10008), 2008.
17. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: bringing order to the web. Technical Report SIDL-WP-1999-0120, Stanford University, 1999.
18. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
19. M. R. Garey and D. S. Johnson. Computers and intractability. W. H. Freeman, 1979.
20. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web. In WWW, 2000.
21. S. Papadimitriou, J. Sun, C. Faloutsos, and P. S. Yu. Hierarchical, parameter-free community discovery. In ECML/PKDD, 2008.
22. J. Leskovec, K. J. Lang, and M. W. Mahoney. Empirical comparison of algorithms for network community detection. In WWW, 2010.
23. M. Sozio and A. Gionis. The community-search problem and how to plan a successful cocktail party. In KDD, 2010.
24. J. Gao, F. Liang, W. Fan, C. Wang, Y. Sun, and J. Han. On community outliers and their efficient detection in information networks. In KDD, 2010.
25. T. Yang, R. Jin, Y. Chi, and S. Zhu. Combining link and content for community detection: a discriminative approach. In KDD, 2009.
26. L. Tang, H. Liu, J. Zhang, and Z. Nazeri. Community evolution in dynamic multi-mode networks. In KDD, 2008.
27. C. Tantipathananandh and T. Y. Berger-Wolf. Constant-factor approximation algorithms for identifying dynamic communities. In KDD, 2009.
28. Y.-R. Lin, J. Sun, P. Castro, R. B. Konuru, H. Sundaram, and A. Kelliher. Metafac: community discovery via relational hypergraph factorization. In KDD, 2009.
29. T. L. Fond and J. Neville. Randomization tests for distinguishing social influence and homophily effects. In WWW, 2010.
30. Y. Zhang, J. Wang, Y. Wang, and L. Zhou. Parallel community detection on large networks with propinquity dynamics. In KDD, 2009.
31. V. Satuluri and S. Parthasarathy. Scalable graph clustering using stochastic flows: applications to community discovery. In KDD, 2009.
32. A. S. Maiya and T. Y. Berger-Wolf. Sampling community structure. In WWW, 2010.
33. M. D. Choudhury, W. A. Mason, J. M. Hofman, and D. J. Watts. Inferring relevant social networks from interpersonal communication. In WWW, 2010.
34. J. Chen, O. R. Za?iane, and R. Goebel. Detecting communities in social networks using max-min modularity. In SDM, 2009.
35. W. Chen, Z. Liu, X. Sun, and Y. Wang. A game-theoretic framework to identify overlapping communities in social networks. Data Min. Knowl. Discov., 21(2):224-240, 2010.
36. D. J. Crandall, D. Cosley, D. P. Huttenlocher, J. M. Kleinberg, and S. Suri. Feedback effects between similarity and social influence in online communities. In KDD, 2008.
37. J. Tang, J. Sun, C. Wang, and Z. Yang. Social influence analysis in large-scale networks. In KDD, 2009.
38. M. Gomez-Rodriguez, J. Leskovec, and A. Krause. Inferring networks of diffusion and influence. In KDD, 2010.