Abstract
Events and stories can be characterized by a set of de scriptive, collocated keywords. Intuitively, documents describing the same event will contain similar sets of keywords, and the graph of keywords for a document collection will contain clusters individual events. In this paper we build a network of keywords based on their co-occurrence in documents. We propose and develop a new event detection algorithm which creates a keyword graph and uses community detection methods analo gous to those used for social network analysis to dis cover and describe events. Constellations of keywords describing an event may be used to find related articles. We also use the proposed algorithm to analyze events and track stories in social streams.
Cite
CITATION STYLE
Sayyadi, H., Hurst, M., & Maykov, A. (2009). Event Detection and Tracking in Social Streams. In Proceedings of the 3rd International AAAI Conference on Weblogs and Social Media, ICWSM 2009 (pp. 311–314). AAAI Press. https://doi.org/10.1609/icwsm.v3i1.13970
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.