|
|
| (10 intermediate revisions by the same user not shown) |
| Line 1: |
Line 1: |
| − | This [[Category::Paper]] is relevant to our project on detecting controversial events in Twitter.
| + | #REDIRECT [[Q._Zhao,_P._Mitra,_and_B._Chen._Temporal_and_information_flow_based_event_detection_from_social_text_streams._In_AAAI,_2007]] |
| − | | |
| − | == Citation ==
| |
| − | | |
| − | Qiankun Zhao, Prasenjit Mitra, and Bi Chen. Temporal and information flow based event detection from social text streams. In Proceedings of the 22nd national conference on Artificial intelligence - Volume 2, pages 1501–1506. AAAI Press, 2007.
| |
| − | | |
| − | == Online version ==
| |
| − | | |
| − | [http://www.purdue.edu/discoverypark/vaccine/assets/pdfs/publications/pdf/Temporal%20and%20Information%20Flow%20Based.pdf Temporal and information flow based event detection from social text streams]
| |
| − | | |
| − | == Summary ==
| |
| − | | |
| − | The authors proposes a method for detecting events from social text stream by exploiting more than just the textual content, but also exploring the temporal and social dimensions of their data.
| |
| − | Social text streams are represented as multigraphs where each node denote an "actor" and an edge represents the information flow between two actors.
| |
| − | First, the authors did content based clustering using a vector space model (tf-idf weights, cosine similarity, the works) and graph cut based clustering algorithm.
| |
| − | This clustering segments their data into topics.
| |
| − | For a given topic, they measure the "intensities" over time using a sliding time window and segment them into intervals using an adaptive time series model.
| |
| − | With the temporal segmentation, each topic is represented as a sequence of social network graphs over time.
| |
| − | The weight of edges between different actors in this graph denote their communication intensity, and one can measure the "information flow" between actors for a given topic over time.
| |
| − | | |
| − | With the above content, temporal and information flow data, they extract events by extracting text segments subject to constraints on these information. For instance, an event should be from the same time interval, be about the same topics and mainly between a certain sub group of social actors.
| |
| − | | |
| − | They used the Enron Email dataset and Dailykos blogs. 30 events are manually labeled as ground truth in the dataset by looking for correspondance with real world news. a
| |
| − | | |
| − | == Evaluation ==
| |
| − | | |
| − | | |
| − | == Discussion ==
| |
| − | | |
| − | | |
| − | == Related papers ==
| |
| − | There has been a lot of work on event detection.
| |
| − | * [[RelatedPaper::Lin_et_al_KDD_2011|Lin et al, KDD 2011]] This paper address a method to observe and track the popular events or topics that evolve over time in the communities.
| |
| − | * [[UsesMethod::Popular_Event_Tracking|Popular Event Tracking]] A method that take both interest and network structure into account.
| |
| − | * [[RelatedPaper::Automatic_Detection_and_Classification_of_Social_Events|Automatic Detection and Classification of Social Events]] This paper aims at detecting and classifying social events using Tree kernels.
| |
| − | | |
| − | == Study plan ==
| |
| − | * Article: Group average agglomerative clustering [http://nlp.stanford.edu/IR-book/html/htmledition/group-average-agglomerative-clustering-1.html]
| |
| − | * Article: Single pass clustering [http://orion.lcg.ufrj.br/Dr.Dobbs/books/book5/chap16.htm]
| |
