Back to papers
Mining Top-k Pairs of Correlated Subgraphs in a Large Network
Summary: Correlated Subgraph Mining (CSM): top-k co-occurring subgraph pattern pairs in a single graph, beyond frequent subgraphs. Exact CSM-E and approximate CSM-A; top-k pruning; Replica, an on-demand compressed store of subgraph instances, enables scalable mining.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12060
- Venue
- VLDB
- Year
- 2020
- Pagerank
- 4.5581054e-05
- Overall Rank
- 8,210 | 42.89%
- DOI
-
10.14778/3397230.3397245
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 36 |
Fast Algorithms for Mining Association Rules |
1994 |
VLDB |
0.00076161096 |
| 1,089 |
GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph |
2014 |
VLDB |
0.00014157922 |
| 1,285 |
Neighborhood Based Fast Graph Search in Large Networks |
2011 |
SIGMOD |
0.00012833377 |
| 1,414 |
Graph Pattern Matching: From Intractable to Polynomial Time |
2010 |
VLDB |
0.00012118275 |
| 1,747 |
Mining Significant Graph Patterns by Leap Search |
2008 |
SIGMOD |
0.00010691242 |
| 2,551 |
NeMa: Fast Graph Search with Label Similarity |
2013 |
VLDB |
8.5572574e-05 |
| 2,930 |
Assessing and Ranking Structural Correlations in Graphs |
2011 |
SIGMOD |
7.8723983e-05 |
| 2,938 |
Graph Homomorphism Revisited for Graph Matching |
2010 |
VLDB |
7.8524059e-05 |
| 3,202 |
VIIQ: Auto-Suggestion Enabled Visual Interface for Interactive Graph Query Formulation |
2015 |
VLDB |
7.3911717e-05 |
| 3,987 |
COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks |
2015 |
SIGMOD |
6.5605514e-05 |
| 4,716 |
Mining Graph Patterns Efficiently via Randomized Summaries |
2009 |
VLDB |
5.9755569e-05 |
| 5,159 |
Towards Proximity Pattern Mining in Large Graphs |
2010 |
SIGMOD |
5.6587631e-05 |
| 5,436 |
Output Space Sampling for Graph Patterns |
2009 |
VLDB |
5.5042223e-05 |
| 5,776 |
Capturing Topology in Graph Pattern Matching |
2012 |
VLDB |
5.3309758e-05 |
| 6,080 |
Answering Top-k Representative Queries on Graph Databases |
2014 |
SIGMOD |
5.2214553e-05 |
| 6,760 |
GAIA: Graph Classification Using Evolutionary Computation |
2010 |
SIGMOD |
4.9349071e-05 |
| 7,614 |
Mining Attribute-structure Correlated Patterns in Large Attributed Graphs |
2012 |
VLDB |
4.6947636e-05 |
| 9,193 |
SkyGraph: Retrieving Regions of Interest using Skyline Subgraph Queries |
2017 |
VLDB |
4.3764958e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,330 |
Mining Top-K Large Structural Patterns in a Massive Network |
2011 |
VLDB |
6.2839861e-05 |
| 10,848 |
Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds |
2025 |
VLDB |
4.1945683e-05 |
| 4,344 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
6.2744553e-05 |
| 3,480 |
CSV: Visualizing and Mining Cohesive Subgraphs |
2008 |
SIGMOD |
7.0538737e-05 |
| 4,716 |
Mining Graph Patterns Efficiently via Randomized Summaries |
2009 |
VLDB |
5.9755569e-05 |
| 10,681 |
Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory |
2025 |
VLDB |
4.1945683e-05 |
| 5,854 |
Diversified Top-k Subgraph Querying in a Large Graph |
2016 |
SIGMOD |
5.3006473e-05 |
| 2,909 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9305767e-05 |
| 4,394 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.224902e-05 |
| 7,614 |
Mining Attribute-structure Correlated Patterns in Large Attributed Graphs |
2012 |
VLDB |
4.6947636e-05 |