Mining Top-K Large Structural Patterns in a Massive Network
Summary: SpiderMine mines top-K patterns in a network with probability 1-ε. Abandoning edge-by-edge growth, it uses bounded-diameter spiders and a probabilistic framework to prune growth, trim combinatorics, and speed isomorphism via a multi-set spider encoding. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Feida Zhu
- 2. Qiang Qu
- 3. David Lo
- 4. Xifeng Yan
- 5. Jiawei Han
- 6. Philip S. Yu
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 651 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018648572 |
| 1,675 | A Distributed Graph Engine for Web Scale RDF Data | 2013 | VLDB | 0.00010947606 |
| 11,559 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD | 4.1945683e-05 |
| 12,043 | A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery | 2013 | SIGMOD | 4.1945683e-05 |
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 |
|---|---|---|---|---|
| 203 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00034889335 |
| 350 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00026365067 |
| 1,747 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD | 0.00010691242 |
| 2,035 | Generating Example Data for Dataflow Programs | 2009 | SIGMOD | 9.7149269e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13,457 | Managing and Mining Large Graphs: Patterns and Algorithms | 2012 | SIGMOD | - |
| 5,436 | Output Space Sampling for Graph Patterns | 2009 | VLDB | 5.5042223e-05 |
| 1,747 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD | 0.00010691242 |
| 820 | GraphMiner: A Structural Pattern-Mining System for Large Disk-based Graph Databases and Its Applications | 2005 | SIGMOD | 0.00016289354 |
| 57 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00065491112 |
| 5,159 | Towards Proximity Pattern Mining in Large Graphs | 2010 | SIGMOD | 5.6587631e-05 |
| 8,210 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB | 4.5581054e-05 |
| 4,716 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB | 5.9755569e-05 |
| 7,614 | Mining Attribute-structure Correlated Patterns in Large Attributed Graphs | 2012 | VLDB | 4.6947636e-05 |
| 4,089 | On Dense Pattern Mining in Graph Streams [Extended Abstract] | 2010 | VLDB | 6.4587806e-05 |