On Dense Pattern Mining in Graph Streams
Summary: Introduces a model for mining frequently occurring dense substructures directly from massive edge streams. Probabilistic stream summarization enables efficient downstream pattern discovery, with effective results on real and synthetic networks. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Charu C. Aggarwal (IBM)
- 2. Yao Li (University of Illinois Chicago)
- 3. Philip S. Yu (University of Illinois Chicago)
- 4. Ruoming Jin (Kent State University)
BibTeX Citation
@article{aggarwal_vldb10,
title = {{On Dense Pattern Mining in Graph Streams}},
author = {Aggarwal, Charu C. and Li, Yao and Yu, Philip S. and Jin, Ruoming},
journal = {PVLDB},
series = {{VLDB} '10},
volume = {3},
number = {1},
pages = {975--978},
doi = {10.14778/1920841.1920964},
url = {https://doi.org/10.14778/1920841.1920964},
year = {2010}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,377 | gSketch: On Query Estimation in Graph Streams | 2012 | VLDB | 8.6710302e-05 |
| 2,896 | Online Density Bursting Subgraph Detection from Temporal Graphs | 2019 | VLDB | 7.9828452e-05 |
| 4,813 | Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs | 2013 | VLDB | 6.4974292e-05 |
| 6,873 | Triangle and Four Cycle Counting in the Data Stream Model | 2020 | PODS | 5.7495468e-05 |
| 11,249 | Efficient Discovery of Significant Patterns with Few-Shot Resampling | 2024 | VLDB | 5.093636e-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 |
|---|---|---|---|---|
| 138 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00029823423 |
| 548 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00016694936 |
| 4,683 | False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams | 2004 | VLDB | 6.5641059e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 138 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB |
| 2 | 4,503 | Event Pattern Matching over Graph Streams | 2015 | VLDB |
| 3 | 7,277 | Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments | 2012 | VLDB |
| 4 | 5,401 | Towards Proximity Pattern Mining in Large Graphs | 2010 | SIGMOD |
| 5 | 5,603 | Output Space Sampling for Graph Patterns | 2009 | VLDB |
| 6 | 564 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB |
| 7 | 4,282 | Mining Top-K Large Structural Patterns in a Massive Network | 2011 | VLDB |
| 8 | 2,013 | Space Efficient Mining of Multigraph Streams | 2005 | PODS |
| 9 | 4,581 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB |
| 10 | 7,466 | Mining Attribute-structure Correlated Patterns in Large Attributed Graphs | 2012 | VLDB |