A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery
Summary: Direct mining framework for constrained graph pattern discovery. SkinnyMine mines l-long delta-skinny patterns via canonical diameter ensuring completeness and unique generation; introduces reducibility and continuity for qualified constraints. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Feida Zhu (Singapore Management University)
- 2. Zequn Zhang (University of Science and Technology Beijing)
- 3. Qiang Qu (Aarhus University)
BibTeX Citation
@inproceedings{zhu_sigmod13,
title = {{A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery}},
author = {Zhu, Feida and Zhang, Zequn and Qu, Qiang},
series = {{SIGMOD} '13},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2463676.2463723},
url = {https://dl.acm.org/doi/10.1145/2463676.2463723},
year = {2013}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,002 | ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks | 2016 | SIGMOD | 5.7280021e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 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 |
| 727 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB | 0.00014565738 |
| 731 | PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks | 2011 | VLDB | 0.00014537965 |
| 1,972 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD | 9.3708222e-05 |
| 4,282 | Mining Top-K Large Structural Patterns in a Massive Network | 2011 | VLDB | 6.7842201e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,581 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB |
| 2 | 5,401 | Towards Proximity Pattern Mining in Large Graphs | 2010 | SIGMOD |
| 3 | 161 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD |
| 4 | 3,324 | Mining Compressed Frequent-Pattern Sets | 2005 | VLDB |
| 5 | 1,972 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD |
| 6 | 262 | On Triangulation-based Dense Neighborhood Graph Discovery | 2011 | VLDB |
| 7 | 7,466 | Mining Attribute-structure Correlated Patterns in Large Attributed Graphs | 2012 | VLDB |
| 8 | 5,538 | Mining Frequent Patterns with Differential Privacy | 2013 | VLDB |
| 9 | 4,236 | On Dense Pattern Mining in Graph Streams | 2010 | VLDB |
| 10 | 2,709 | GraphMiner: A Structural Pattern-Mining System for Large Disk-based Graph Databases and Its Applications | 2005 | SIGMOD |