Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments
Summary: Real-time event discovery from microblog streams via dense clusters in dynamic graphs; introduces the short-cycle prop. for evolving subgraphs. Proposes efficient clustering and a ranking function with proofs, validated on real data, achieving high precision/recall on dynamic graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Manoj K Agarwal (IBM)
- 2. Krithi Ramamritham (Indian Institute of Technology Mumbai)
- 3. Manish Bhide (IBM India Software Labs)
BibTeX Citation
@article{agarwal_vldb12,
title = {{Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments}},
author = {Agarwal, Manoj K and Ramamritham, Krithi and Bhide, Manish},
journal = {PVLDB},
series = {{VLDB} '12},
volume = {5},
number = {10},
pages = {980--991},
doi = {10.14778/2336664.2336675},
url = {https://doi.org/10.14778/2336664.2336675},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,376 | Mining Bursting Core in Large Temporal Graphs | 2022 | VLDB | 7.3590905e-05 |
| 5,065 | Spruce: A Fast yet Space-saving Structure for Dynamic Graph Storage | 2024 | SIGMOD | 6.2901915e-05 |
| 11,300 | Triparts: Scalable Streaming Graph Partitioning to Enhance Community Structure | 2025 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,483 | TwitterMonitor: Trend Detection over the Twitter Stream | 2010 | SIGMOD | 0.00010537238 |
| 2,884 | Seeking Stable Clusters in the Blogosphere | 2007 | VLDB | 7.9108054e-05 |
| 12,669 | EnBlogue – Emergent Topic Detection in Web 2.0 Streams | 2011 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,789 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 2 | 2,869 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |
| 3 | 3,574 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB |
| 4 | 561 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB |
| 5 | 4,583 | Event Pattern Matching over Graph Streams | 2015 | VLDB |
| 6 | 2,884 | Seeking Stable Clusters in the Blogosphere | 2007 | VLDB |
| 7 | 1,873 | Real-Time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs | 2014 | VLDB |
| 8 | 3,376 | Mining Bursting Core in Large Temporal Graphs | 2022 | VLDB |
| 9 | 4,320 | On Dense Pattern Mining in Graph Streams | 2010 | VLDB |
| 10 | 988 | Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification | 2012 | VLDB |