Content-based crowd retrieval on the real-time web

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 195-204

  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

CLUSTERING; COMMUNITY DETECTION; CONTENT-BASED; CROWD DETECTION; DISCOVERY ALGORITHM; EXPERIMENTAL STUDIES; HIGH QUALITY; K-MEANS; KEY DIMENSIONS; LOCALITY SENSITIVE HASHING; OFF-LINE APPROACHES; REAL-TIME WEB; SALIENT FEATURES; SOCIAL MEDIA; USER ACTIVITY; USER PROFILE; WEB MONITORING;

ALGORITHMS; KNOWLEDGE MANAGEMENT; TREES (MATHEMATICS);

SOCIAL NETWORKING (ONLINE);

EID: 84871038972     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2396761.2396789     Document Type: Conference Paper

References (28)

1. Infinite coordinate space. wikipedia: Examples of vector spaces, 2011.
2. C. C. Aggarwal. A framework for clustering massive text and categorical data streams. In In: Proc. SIAM conference on Data Mining, pages 477-481, 2006.
3. C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu. A framework for clustering evolving data streams. In Proceedings of the 29th international conference on Very large data bases - Volume 29, VLDB '2003, pages 81-92. VLDB Endowment, 2003.
4. J. Allan. Introduction to topic detection and tracking, pages 1-16. Kluwer Academic Publishers, Norwell, MA, USA, 2002.
5. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. J. Mach. Learn. Res., 3:993-1022, March 2003.
6. M. S. Charikar. Similarity estimation techniques from rounding algorithms. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, STOC '02, pages 380-388, New York, NY, USA, 2002. ACM.
7. S. Chen, H. Wang, S. Zhou, and P. S. Yu. Stop chasing trends: Discovering high order models in evolving data. In ICDE '08: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, pages 923-932, Washington, DC, USA, 2008. IEEE Computer Society.
8. H. Choi and H. Varian. Predicting the present with google trends. Technical report, Google, 2009.
9. D. R. Cutting, D. R. Karger, J. O. Pedersen, and J. W. Tukey. Scatter/gather: a cluster-based approach to browsing large document collections. In Proceedings of the 15th ACM SIGIR, SIGIR '92, pages 318-329, New York, NY, USA, 1992. ACM.
10. 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.
11. W. Fan, Y. Koyanagi, K. Asakura, and T. Watanabe. Clustering over evolving data streams based on online recent-biased approximation. chapter Knowledge Acquisition: Approaches, Algorithms and Applications, pages 12-26. Springer-Verlag, Berlin, Heidelberg, 2009.
12. M. Franz, T. Ward, J. S. McCarley, and W.-J. Zhu. Unsupervised and supervised clustering for topic tracking. In Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '01, pages 310-317, New York, NY, USA, 2001. ACM.
13. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In Proceedings of the 25th International Conference on Very Large Data Bases, VLDB '99, pages 518-529, San Francisco, CA, USA, 1999. Morgan Kaufmann Publishers Inc.
14. L. Gong, J. Zeng, and S. Zhang. Text stream clustering algorithm based on adaptive feature selection. Expert Syst. Appl., 38:1393-1399, March 2011.
15. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, STOC '98, pages 604-613, New York, NY, USA, 1998. ACM.
16. K. Y. Kamath and J. Caverlee. Transient crowd discovery on the real-time social web. In Proceedings of the fourth ACM international conference on Web search and data mining, WSDM '11, pages 585-594, New York, NY, USA, 2011. ACM.
17. C. X. Lin, B. Zhao, Q. Mei, and J. Han. PET: A statistical model for popular events tracking in social communities. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD), pages 929-938, New York, NY, USA, 2010. ACM.
18. Y.-B. Liu, J.-R. Cai, J. Yin, and A. W.-C. Fu. Clustering text data streams. Journal of Computer Science and Technology, 23(1):112-128, 2008.
19. C. D. Manning, P. Raghavan, and H. Schtze. Introduction to Information Retrieval. Cambridge University Press, New York, NY, USA, 2008.
20. F. Moerchen, K. Brinker, and C. Neubauer. Any-time clustering of high frequency news streams. 2007.
21. M. E. J. Newman. Fast algorithm for detecting community structure in networks, September 2003.
22. S. Petrović, M. Osborne, and V. Lavrenko. Streaming first story detection with application to twitter. In Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, HLT '10, pages 181-189, Stroudsburg, PA, USA, 2010. Association for Computational Linguistics.
23. D. Ravichandran, P. Pantel, and E. Hovy. Randomized algorithms and nlp: using locality sensitive hash function for high speed noun clustering. In Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, ACL '05, pages 622-629, Stroudsburg, PA, USA, 2005. Association for Computational Linguistics.
24. T. Sakaki, M. Okazaki, and Y. Matsuo. Earthquake shakes twitter users: real-time event detection by social sensors. In WWW '10, pages 851-860, New York, NY, USA, 2010. ACM.
25. L. Tang and H. Liu. Community Detection and Mining in Social Media. Morgan and Claypool, 2010.
26. X. Wang, L. Tang, H. Gao, and H. Liu. Discovering overlapping groups in social media. In Proceedings of the 2010 IEEE International Conference on Data Mining (ICDM), pages 569-578, Washington, DC, USA, 2010. IEEE Computer Society.
27. S. Wu, J. M. Hofman, D. J. Watts, and W. A. Mason. Who says what to whom on twitter. WWW 2011, 2011.
28. Y. Zhu and D. Shasha. Statstream: statistical monitoring of thousands of data streams in real time. In Proceedings of the 28th international conference on Very Large Data Bases, VLDB '02, pages 358-369. VLDB Endowment, 2002.