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

@article{Angel2013DenseSM,
  title={Dense subgraph maintenance under streaming edge weight updates for real-time story identification},
  author={Albert Angel and Nick Koudas and Nikos Sarkas and Divesh Srivastava and Michael Svendsen and Srikanta Tirthapura},
  journal={The VLDB Journal},
  year={2013},
  volume={23},
  pages={175-199}
}
Recent years have witnessed an unprecedented proliferation of social media. People around the globe author, everyday, millions of blog posts, social network status updates, etc. This rich stream of information can be used to identify, on an ongoing basis, emerging stories, and events that capture popular attention. Stories can be identified via groups of tightly coupled real-world entities, namely the people, locations, products, etc, that are involved in the story. The sheer scale and rapid… 
Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification
TLDR
This is the first work to study the efficient maintenance of dense subgraphs under streaming edge weight updates of real-time story identification, and proposes a novel algorithm, DynDens, which outperforms adaptations of existing techniques to this setting, and yields meaningful results.
Keyword-based correlated network computation over large social media
TLDR
This paper proposes and defines the problem of keyword-based correlated network computation over a massive graph, and presents a novel tree data structure that only maintains the shortest path of any two graph nodes, by which the massive graph can be equivalently transformed into a treeData structure for addressing the proposed problem.
CAST: A Context-Aware Story-Teller for Streaming Social Content
TLDR
This paper proposes CAST, which is a context-aware story-teller that discovers new stories from social streams and tracks their structural context on the fly to build a vein of stories.
CAST : A Context-Aware Story-Teller for Streaming Social Content
TLDR
This paper proposes CAST, which is a context-aware story-teller that discovers new stories from social streams and tracks their structural context on the fly to build a vein of stories.
The importance of unexpectedness: Discovering buzzing stories in anomalous temporal graphs
TLDR
A novel method is proposed that characterizes abnormal association between terms in a certain time window and leverages the graph structure induced by such anomalous associations so as to identify stories as subsets of terms that are cohesively associated in this graph.
Event Evolution Tracking from Streaming Social Posts
TLDR
Evaluation on a real data set consisting of 5.2 million posts demonstrates that the method can effectively track event dynamics in the whole life cycle from very large volumes of social streams on the fly.
Streaming Social Event Detection and Evolution Discovery in Heterogeneous Information Networks
TLDR
This article designs a novel event-based meta-schema to characterize the semantic relatedness of social events and proposes a novel Pairwise Popularity Graph Convolutional Network, named as PP-GCN, based on weighted meta-path instance similarity and textual semantic representation as inputs to perform fine-grained social event categorization.
Finding Heaviest k-Subgraphs and Events in Social Media
TLDR
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.
Dynamic Community Detection in Weighted Graph Streams
TLDR
A novel structure termed Local Weighted-Edge-based Pattern (LWEP) Summary is proposed to describe a local homogeneous region to efficiently compute LWEPs and an auxiliary data structure termed top-k candidate list is used to identify emerging active neighbors.
Entity-level Event Impact Analytics
TLDR
This thesis addresses three facets in the context of events and the Web, namely, diffusion of events in foreign languages communities, automated classification of Web contents, and news virality assessment and visualization, and hypothesizes that the named entities associated with an event or a Web content carry valuable semantic information which can be exploited to build accurate prediction models.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 43 REFERENCES
Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification
TLDR
This is the first work to study the efficient maintenance of dense subgraphs under streaming edge weight updates of real-time story identification, and proposes a novel algorithm, DynDens, which outperforms adaptations of existing techniques to this setting, and yields meaningful results.
Seeking Stable Clusters in the Blogosphere
TLDR
This paper formalizes intuition and presents efficient algorithms to identify keyword clusters in large collections of blog posts for specific temporal intervals, and formalizes problems related to the temporal properties of such clusters.
CSV: visualizing and mining cohesive subgraphs
TLDR
This article proposes an approximate algorithm, to mine and visualize cohesive subgraphs (dense sub components) within a large graph, which relies on a novel mapping strategy that maps edges and nodes to a multi-dimensional space wherein dense areas in the mapped space correspond to cohesive sub graphs.
CHRONICLE: A Two-Stage Density-Based Clustering Algorithm for Dynamic Networks
TLDR
CHRONICLE is an efficient clustering algorithm that discovers not only clusters of single path type but also clusters of path group type, in order to find clusters of both types and also control the dynamicity of clusters.
What's on the grapevine?
TLDR
Grapevine conducts large scale data analysis on the social media collective, distilling and extracting information in real time, allowing users to discover interesting or surprising stories.
Computational Methods for Dynamic Graphs
TLDR
A data structure and an updating scheme are introduced that captures, in an approximate sense, the graph and its evolution through time and can be enhanced to form what the authors call communities of interest (COI).
Discovering Large Dense Subgraphs in Massive Graphs
TLDR
D dense subgraph extraction is proposed as a useful primitive for spam detection, and its incorporation into the workflow of web search engines is discussed.
Efficient identification of coupled entities in document collections
TLDR
This work introduces a methodology for discovering strong entity associations in all the slices (meta-data value restrictions) of a document collection and devise and evaluate algorithms capable of addressing two flavors of the core problem: algorithm THR-ENT for computing all sufficiently strong entities associations and algorithm TOP-ENTS for computing the top-k strongest entity associations.
Building an Effective Representation for Dynamic Networks
TLDR
This article develops a generic framework for evaluating and tuning any dynamic graph, and shows that the storage saving approximations involved in the representation do not affect predictive performance, and typically improve it.
Efficient identification of Web communities
TLDR
A focused crawler that crawls to a depth can approximate community membership by augmenting the graph induced by the cra wl with links to a virtual sink node.
...
1
2
3
4
5
...