Difference between revisions of "Class Meeting for 10-802 02/15/2011"
From Cohen Courses
Jump to navigationJump to search
Line 16: | Line 16: | ||
* Roth, M., A. Ben-David, D. Deutscher, G. Flysher, I. Horn, A. Leichtberg, N. Leiser, Y. Matias, and R. Merom. 2010. Suggesting friends using the implicit social graph. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, 233–242. | * Roth, M., A. Ben-David, D. Deutscher, G. Flysher, I. Horn, A. Leichtberg, N. Leiser, Y. Matias, and R. Merom. 2010. Suggesting friends using the implicit social graph. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, 233–242. | ||
− | * Wang, X., L. Tang, H. Gao, and H. Liu | + | * Wang, X., L. Tang, H. Gao, and H. Liu. Discovering Overlapping Groups in Social Media. ICDM 2010. |
Latest revision as of 09:44, 9 February 2011
This is one of the class meetings on the schedule for the course Social Media Analysis 10-802 in Spring 2011.
Overview
Readings
- Meila, Marina, and Jianbo Shi. 2001. A Random Walks View of Spectral Segmentation. In AI-STATS. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.8065.
- Snijders, T.A.B. & Nowicki, K., Estimation and prediction for stochastic block models for graphs with latent block structure. Journal of Classification, 14 (1997), 75 - 100.
- MS Handcock, AE Raftery, JM Tantrum, Model-based clustering for social networks, Journal of the Royal Stat Soc Series A, 2007, 170(2), pages 301-354
Papers you Might Present
- Roth, M., A. Ben-David, D. Deutscher, G. Flysher, I. Horn, A. Leichtberg, N. Leiser, Y. Matias, and R. Merom. 2010. Suggesting friends using the implicit social graph. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, 233–242.
- Wang, X., L. Tang, H. Gao, and H. Liu. Discovering Overlapping Groups in Social Media. ICDM 2010.