AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling
Summary: AGIS replaces uniform sampling with pattern-dependent, structure-informed neighbor sampling for fast approximate counting of arbitrary graph motifs. Its adaptive distribution selection delivers up to 28.5× average speedups and scales to tens of billions of edges. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Seoyong Lee (Seoul National University)
- 2. Jinho Lee (Seoul National University)
BibTeX Citation
@article{lee_vldb26,
title = {{AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling}},
author = {Lee, Seoyong and Lee, Jinho},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {2},
pages = {238--251},
doi = {10.14778/3773749.3773761},
url = {https://doi.org/10.14778/3773749.3773761},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 239 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.000235107 |
| 1,121 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.000119396 |
| 1,940 | A General Framework for Estimating Graphlet Statistics via Random Walk | 2017 | VLDB | 9.3302142e-05 |
| 2,468 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD | 8.4178183e-05 |
| 2,518 | Fractal: A General-Purpose Graph Pattern Mining System | 2019 | SIGMOD | 8.3533785e-05 |
| 4,575 | On Sampling from Massive Graph Streams | 2017 | VLDB | 6.5256176e-05 |
| 5,422 | Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach | 2024 | VLDB | 6.1361195e-05 |
| 5,450 | Accurate and Fast Approximate Graph Pattern Mining at Scale | 2025 | VLDB | 6.1247776e-05 |
| 9,368 | RUSH: Real-time Burst Subgraph Detection in Dynamic Graphs | 2024 | VLDB | 5.1868213e-05 |
| 9,386 | Behavior Query Discovery in System-Generated Temporal Graphs | 2016 | VLDB | 5.1868213e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,010 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD |
| 2 | 4,647 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB |
| 3 | 2,767 | GraphMiner: A Structural Pattern-Mining System for Large Disk-based Graph Databases and Its Applications | 2005 | SIGMOD |
| 4 | 4,350 | Mining Top-K Large Structural Patterns in a Massive Network | 2011 | VLDB |
| 5 | 1,148 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB |
| 6 | 12,065 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD |
| 7 | 5,729 | Output Space Sampling for Graph Patterns | 2009 | VLDB |
| 8 | 12,059 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 9 | 1,027 | GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph | 2014 | VLDB |
| 10 | 5,450 | Accurate and Fast Approximate Graph Pattern Mining at Scale | 2025 | VLDB |