EviDense: A Graph-Based Method for Finding Unique High-Impact Events with Succinct Keyword-Based Descriptions

  title={EviDense: A Graph-Based Method for Finding Unique High-Impact Events with Succinct Keyword-Based Descriptions},
  author={Oana Balalau and Carlos Castillo and Mauro Sozio},
Despite the significant efforts made by the research community in recent years, automatically acquiring valuable information about high impact-events from social media remains challenging. We present EVIDENSE, a graph-based approach for finding high-impact events (such as disaster events) in social media. Our evaluation shows that our method outperforms state-of-the-art approaches for the same problem, in terms of having higher precision, lower number of duplicates, while providing a… 

Figures and Tables from this paper

Finding events in temporal networks: segmentation meets densest subgraph discovery

This paper model events as dense subgraphs that occur within intervals of network activity that capture the most interesting events during the network lifetime, and shows that on static graphs a simple greedy algorithm leads to approximate solution due to submodularity.



Finding Heaviest k-Subgraphs and Events in Social Media

This paper develops an exact algorithm for solving the heaviest k-subgraph problem which is an NP-hard problem, and shows that the algorithm can be used to find relevant events in Twitter.

Dense subgraph maintenance under streaming edge weight updates for real-time story identification

This work proposes a novel algorithm, DynDens, which outperforms adaptations of existing techniques to this setting and yields meaningful, intuitive results in real-time story identification.

Efficient Densest Subgraph Computation in Evolving Graphs

This work studies the densest subgraph problem in the the dynamic graph model, for which it is presented the first scalable algorithm with provable guarantees, and shows that (approximate) densmost subgraphs can be maintained efficiently within hundred of microseconds per update.

Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments

This paper presents techniques to discover events that are unraveling in microblog message streams in real time so that such events can be reported as soon as they occur and is the first technique to identify dense clusters in massive and highly dynamic graphs inreal time.

Finding Subgraphs with Maximum Total Density and Limited Overlap

This work defines and study a natural generalization of the densest subgraph problem, where the main goal is to find at most $k$ sub graphs with maximum total aggregate density, while satisfying an upper bound on the pairwise Jaccard coefficient between the sets of nodes of the subgraphs.

Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs

A user evaluation confirms that the patterns found in the distance restricted densest subgraph for a dataset of photomorphogenesis genes are indeed validated in the literature; a control dataset validates that these are not random patterns.

Event detection in social media: A survey

Topics related to analyzing social media for detecting four types of event, that is, disaster, traffic, outbreak, and news are described.

Event Identification and Tracking in Social Media Streaming Data

A simple sliding window model is discussed, which uses shifts in the inverse document frequency (IDF) to capture trending terms as well as to track the evolution and the context around events.

Mention-anomaly-based Event Detection and tracking in Twitter

  • Adrien GuilleCécile Favre
  • Computer Science
    2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)
  • 2014
The experiments show that the mention-anomaly-based approach leads to more accurate event detection and improved robustness in presence of noisy Twitter content, and that MABED helps with the interpretation of detected events by providing clear and precise descriptions.

Event identification for local areas using social media streaming data

A method for event identification in local areas using the Twitter data stream using a combined log-likelihood ratio approach for the geographic and time dimension of real-life Twitter data in predefined areas of the world to detect events occurring in the message contents.