Identifying hotspots on the real-time web

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2010, Pages 1837-1840

  Kamath, Krishna Y ^a   Caverlee, James ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Clustering; Graph; Real time; Social

Indexed keywords

CLUSTERING; CLUSTERING APPROACH; COMPUTATIONAL COSTS; EVOLVING GRAPHS; FACEBOOK; GRAPH; GRAPH CLUSTERING; HOTSPOTS; MESSAGE-BASED COMMUNICATION; MESSAGING SYSTEM; REAL-TIME; SALIENT FEATURES; SOCIAL;

KNOWLEDGE MANAGEMENT; SOCIAL NETWORKING (ONLINE);

CLUSTERING ALGORITHMS;

EID: 78651342470     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1871437.1871742     Document Type: Conference Paper

References (6)

1. A website that maintains statistical information about tweets. http://popacular.com/gigatweet/.
2. 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.
3. G. W. Flake, R. E. Tarjan, and K. Tsioutsiouliklis. Graph clustering and minimum cut trees. Internet Mathematics, 1(4): 385-408, 2004.
4. 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.
5. 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.
6. S. Van Dongen. Graph clustering via a discrete uncoupling process. SIAM J. Matrix Anal. Appl., 30(1): 121-141, 2008.