Mining Significant Graph Patterns by Leap Search
Summary: Introduces LEAP, a framework for mining the most significant graph patterns under general, non-antimonotonic objectives. Structural leap search and frequency-descending mining rapidly identify highly significant patterns, outperforming branch-and-bound and enabling effective graph classification. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xifeng Yan (IBM)
- 2. Hong Cheng (University of Illinois Urbana-Champaign)
- 3. Jiawei Han (University of Illinois Urbana-Champaign)
- 4. Philip S. Yu (University of Illinois Chicago)
BibTeX Citation
@inproceedings{yan_sigmod08,
title = {{Mining Significant Graph Patterns by Leap Search}},
author = {Yan, Xifeng and Cheng, Hong and Han, Jiawei and Yu, Philip S.},
series = {{SIGMOD} '08},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1376616.1376662},
url = {https://dl.acm.org/doi/10.1145/1376616.1376662},
year = {2008}
}
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13 | Mining Association Rules between Sets of Items in Large Databases | 1993 | SIGMOD | 0.0006567919 |
| 177 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00027100548 |
| 326 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00021152829 |
| 4,092 | Traversing Itemset Lattices with Statistical Metric Pruning | 2000 | PODS | 6.907339e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,703 | Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs | 2017 | SIGMOD |
| 2 | 1,085 | GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph | 2014 | VLDB |
| 3 | 4,282 | Mining Top-K Large Structural Patterns in a Massive Network | 2011 | VLDB |
| 4 | 4,236 | On Dense Pattern Mining in Graph Streams | 2010 | VLDB |
| 5 | 12,241 | A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery | 2013 | SIGMOD |
| 6 | 11,249 | Efficient Discovery of Significant Patterns with Few-Shot Resampling | 2024 | VLDB |
| 7 | 5,603 | Output Space Sampling for Graph Patterns | 2009 | VLDB |
| 8 | 2,709 | GraphMiner: A Structural Pattern-Mining System for Large Disk-based Graph Databases and Its Applications | 2005 | SIGMOD |
| 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 |