Transient crowd discovery on the real-time social web

Proceedings of the 4th ACM International Conference on Web Search and Data Mining, WSDM 2011

Volumn , Issue , 2011, Pages 585-594

  Kamath, Krishna Y ^a   Caverlee, James ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Clustering; Community detection; Real time web; Social media

Indexed keywords

ACROSS TIME; CLUSTERING; CLUSTERING APPROACH; COMMUNICATION STRUCTURES; COMMUNITY DETECTION; COMPUTATIONAL COSTS; CONTENT PERSONALIZATION; CROWD TRACKING; EVOLVING GRAPHS; FACEBOOK; GRAPH CLUSTERING; GROUP-BASED; HIGH QUALITY; HOT SPOT; HOTSPOTS; MESSAGE-BASED COMMUNICATION; MESSAGING SYSTEM; ONLINE EVENT DETECTION; REAL-TIME WEB; RESEARCH DIRECTIONS; SALIENT FEATURES; SOCIAL INFORMATION; SOCIAL MEDIA; SOCIAL NETWORKS;

CLUSTERING ALGORITHMS; DATA MINING; INFORMATION RETRIEVAL; ONLINE SYSTEMS; POPULATION DYNAMICS; WORLD WIDE WEB;

SOCIAL NETWORKING (ONLINE);

EID: 79952369094     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1935826.1935909     Document Type: Conference Paper

References (12)

1. A website that maintains statistical information about tweets. http://popacular.com/gigatweet/.
2. S. Asur, S. Parthasarathy, and D. Ucar. An event-based framework for characterizing the evolutionary behavior of interaction graphs. In KDD '07, pages 913-921, New York, NY, USA, 2007. ACM.
3. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group formation in large social networks: membership, growth, and evolution. In KDD '06, pages 44-54, New York, NY, USA, 2006. ACM.
4. I. Dhillon, Y. Guan, and B. Kulis. A fast kernel-based multilevel algorithm for graph clustering. In KDD '05, pages 629-634, New York, NY, USA, 2005. ACM.
5. G. W. Flake, R. E. Tarjan, and K. Tsioutsiouliklis. Graph clustering and minimum cut trees. Internet Mathematics, 1(4): 385-408, 2004.
6. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. In STOC '86, pages 136-146, New York, NY, USA, 1986. ACM.
7. R. E. Gomory and T. C. Hu. Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics, 9(4): 551-570, 1961.
8. K. Y. Kamath and J. Caverlee. Identifying hotspots on the real-time web. In CIKM '10, New York, NY, USA, 2010. ACM.
9. M. E. J. Newman. Fast algorithm for detecting community structure in networks, September 2003.
10. B. Saha and P. Mitra. Dynamic algorithm for graph clustering using minimum cut tree. In ICDMW '06, pages 667-671, Washington, DC, USA, 2006. IEEE Computer Society.
11. J. Sun, C. Faloutsos, S. Papadimitriou, and P. S. Yu. Graphscope: parameter-free mining of large time-evolving graphs. In 13th ACM SIGKDD' 07, pages 687-696, New York, NY, USA, 2007. ACM.
12. S. Van Dongen. Graph clustering via a discrete uncoupling process. SIAM J. Matrix Anal. Appl., 30(1): 121-141, 2008.