Mining Graph Patterns Efficiently via Randomized Summaries
Summary: Proposes Summarize-Mine, a graph-pattern mining framework that compresses within-transaction graphs with randomized summaries to cut embedding enumeration costs. Repeating with probabilistic guarantees reduces pattern loss, enabling malware fingerprints. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Chen Chen (University of Illinois Urbana-Champaign)
- 2. Cindy X. Lin (University of Illinois Urbana-Champaign)
- 3. Matt Fredrikson (University of Wisconsin)
- 4. Mihai Christodorescu (IBM)
- 5. Xifeng Yan (University of California Santa Barbara)
- 6. Jiawei Han (University of Illinois Urbana-Champaign)
BibTeX Citation
@article{chen_vldb09,
title = {{Mining Graph Patterns Efficiently via Randomized Summaries}},
author = {Chen, Chen and Lin, Cindy X. and Fredrikson, Matt and Christodorescu, Mihai and Yan, Xifeng and Han, Jiawei},
journal = {PVLDB},
series = {{VLDB} '09},
doi = {10.14778/1687627.1687711},
url = {https://doi.org/10.14778/1687627.1687711},
year = {2009}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,751 | Summarizing Static and Dynamic Big Graphs | 2017 | VLDB | 6.0994565e-05 |
| 6,641 | GAIA: Graph Classification Using Evolutionary Computation | 2010 | SIGMOD | 5.8162256e-05 |
| 8,206 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB | 5.4666548e-05 |
| 11,202 | Online Detection of Anomalies in Temporal Knowledge Graphs with Interpretability | 2024 | SIGMOD | 5.093636e-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 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 161 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00027981772 |
| 177 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00027100548 |
| 363 | Approximate Query Processing: Taming the TeraBytes! A Tutorial | 2001 | VLDB | 0.0002005475 |
| 462 | Sampling Large Databases for Association Rules | 1996 | VLDB | 0.00018065337 |
| 486 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD | 0.00017692185 |
| 548 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00016694936 |
| 1,972 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD | 9.3708222e-05 |
| 7,691 | Finding Relevant Patterns in Bursty Sequences | 2008 | VLDB | 5.5664827e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,467 | The Power of Summarization in Graph Mining and Learning: Smaller Data, Faster Methods, More Interpretability | 2021 | VLDB |
| 2 | 4,953 | Efficient Graph Summarization using Weighted LSH at Billion-Scale | 2021 | SIGMOD |
| 3 | 1,972 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD |
| 4 | 4,282 | Mining Top-K Large Structural Patterns in a Massive Network | 2011 | VLDB |
| 5 | 8,206 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB |
| 6 | 5,603 | Output Space Sampling for Graph Patterns | 2009 | VLDB |
| 7 | 5,401 | Towards Proximity Pattern Mining in Large Graphs | 2010 | SIGMOD |
| 8 | 2,709 | GraphMiner: A Structural Pattern-Mining System for Large Disk-based Graph Databases and Its Applications | 2005 | SIGMOD |
| 9 | 7,466 | Mining Attribute-structure Correlated Patterns in Large Attributed Graphs | 2012 | VLDB |
| 10 | 4,236 | On Dense Pattern Mining in Graph Streams | 2010 | VLDB |