Finding communities in dynamic social networks

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2011, Pages 1236-1241

  Tantipathananandh, Chayant ^a   Berger Wolf, Tanya Y ^a  

^a University of Illinois   (United States)

Author keywords

Community structure; Dynamic social networks; Semidefinite programming

Indexed keywords

ARBITRARY GRAPHS; COMMUNITY STRUCTURES; HEURISTICS AND APPROXIMATIONS; NATURAL STRUCTURES; OPTIMIZATION PROBLEMS; ROUNDING SCHEMES; SEMI-DEFINITE PROGRAMMING; SOCIAL COST; SOCIAL NETWORKS; SYNTHETIC DATASETS; TEMPORAL ASPECTS; TIME STEP;

APPROXIMATION ALGORITHMS; DATA MINING; MATHEMATICAL PROGRAMMING; SOCIAL SCIENCES;

SOCIAL NETWORKING (ONLINE);

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

References (36)

1. C. C. Aggarwal and P. S. Yu. Online analysis of community evolution in data streams. In SIAM ICDM, 2005.
2. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group formation in large social networks: Membership, growth, and evolution. In ACM KDD, 2006.
3. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. Machine Learning, 56, 2004.
4. T. Y. Berger-Wolf and J. Saia. A framework for analysis of dynamic social networks. In ACM KDD, 2006.
5. T. Y. Berger-Wolf, C. Tantipathananandh, and D. Kempe. Community identification in dynamic social networks. In C. F. Philip S. Yu, Jiawei Han, editor, Link Mining: Models, Algorithms and Applications, chapter 8. Springer, 2010.
6. B. Borchers and J. Young. Implementation of a primal-dual method for sdp on a shared memory parallel architecture. Computational Optimization and Applications, 37, 2007.
7. M. Charikar, V. Guruswami, and A. Wirth. Clustering with qualitative information. In IEEE FOCS, 2003.
8. L. Danon, A. Díaz-Guilera, J. Duch, and A. Arenas. Comparing community structure identification. J. of Statistical Mechanics: Theory and Experiment, 9008, 2005.
9. T. Falkowski. Community Analysis in Dynamic Social Networks. Dissertation, University Magdeburg, 2009.
10. T. Falkowski, J. Bartelheimer, and M. Spiliopoulou. Mining and visualizing the evolution of subgroups in social networks. Web Intelligence, 2006.
11. S. Fortunato. Community detection in graphs. Physics Reports, 486, February 2010.
12. S. Fortunato and C. Castellano. Community structure in graphs. eprint arXiv, 2007.
13. L. Freeman. Finding social groups: A meta-analysis of the southern women data. In R. Breiger, K. Carley, and P. Pattison, editors, Dynamic Social Network Modeling and Analysis. The National Academies Press, 2003.
14. A. M. Frieze and M. Jerrum. Improved approximation algorithms for max k-cut and max bisection. In IPCO, 1995.
15. W. Fu, L. Song, and E. P. Xing. Dynamic mixed membership blockmodel for evolving networks. In ICML, 2009.
16. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. PNAS, 99, 2002.
17. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42, Nov 1995.
18. C. Helmberg, F. Rendl, R. J. Vanderbei, and H. Wolkowicz. An interior-point method for semidefinite programming. SIAM J. on Optimization, 6(2), 1996.
19. A. K. Jain and R. C. Dubes. Algorithms For Clustering Data. Prentice Hall, 1988.
20. J. Leskovec. Stanford network analysis platform (SNAP), Oct 2010. http://snap.stanford.edu/.
21. Y.-R. Lin, Y. Chi, S. Zhu, H. Sundaram, and B. L. Tseng. Facetnet: a framework for analyzing communities and their evolutions in dynamic networks. In WWW, 2008.
22. M. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 69, 2004.
23. G. Palla, I. Dernyi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435, 9 June 2005.
24. M. Pearson and P. West. Drifting smoke rings: Social network analysis and markov processes in a longitudinal study of friendship groups and risk-taking. Connections, 25(2), 2003.
25. M. A. Porter, J.-P. Onnela, and P. J. Mucha. Communities in networks. arXiv preprint, Feb 2009.
26. W. M. Rand. Objective Criteria for the Evaluation of Clustering Methods. J. Am Stat. Assoc., 66(336), 1971.
27. P. Sarkar and A. Moore. Dynamic social network analysis using latent space models. ACM SIGKDD Explorations Newsletter, 7(2), December 2005.
28. J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau. CRAWDAD haggle/imote/intel (2006-01-31).
29. M. Spiliopoulou, I. Ntoutsi, Y. Theodoridis, and R. Schult. MONIC: modeling and monitoring cluster transitions. In ACM KDD, 2006.
30. J. Sun, C. Faloutsos, S. Papadimitriou, and P. S. Yu. Graphscope: parameter-free mining of large time-evolving graphs. In ACM KDD, 2007.
31. C. Swamy. Correlation clustering: maximizing agreements via semidefinite programming. In ACM-SIAM SODA, 2004.
32. C. Tantipathananandh and T. Berger-Wolf. Constant-factor approximation algorithms for identifying dynamic communities. In ACM KDD, 2009.
33. C. Tantipathananandh, T. Berger-Wolf, and D. Kempe. A framework for community identification in dynamic social networks. In ACM KDD, 2007.
34. H. Tong, S. Papadimitriou, J. Sun, P. S. Yu, and C. Faloutsos. Colibri: fast mining of large static and dynamic graphs. In ACM KDD, 2008.
35. S. Wasserman and F. Ku Social Network Analysis. Cambridge University Press, 1994.
36. T. Yang, Y. Chi, S. Zhu, Y. Gong, and R. Jin. A bayesian approach toward finding communities and their evolutions in dynamic social networks. In SIAM ICDM, February 2009.