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
- 12061
- Venue
- VLDB
- Year
- 2020
- Pagerank
- 4.5537353e-05
- Overall Rank
- 8,209 | 42.95%
- 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.00076114894 |
| 1,095 |
GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph |
2014 |
VLDB |
0.00014103799 |
| 1,280 |
Neighborhood Based Fast Graph Search in Large Networks |
2011 |
SIGMOD |
0.00012838714 |
| 1,419 |
Graph Pattern Matching: From Intractable to Polynomial Time |
2010 |
VLDB |
0.00012072488 |
| 1,720 |
Mining Significant Graph Patterns by Leap Search |
2008 |
SIGMOD |
0.00010757565 |
| 2,557 |
NeMa: Fast Graph Search with Label Similarity |
2013 |
VLDB |
8.5484449e-05 |
| 2,930 |
Assessing and Ranking Structural Correlations in Graphs |
2011 |
SIGMOD |
7.8790753e-05 |
| 2,943 |
Graph Homomorphism Revisited for Graph Matching |
2010 |
VLDB |
7.8463193e-05 |
| 3,208 |
VIIQ: Auto-Suggestion Enabled Visual Interface for Interactive Graph Query Formulation |
2015 |
VLDB |
7.3837748e-05 |
| 3,950 |
COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks |
2015 |
SIGMOD |
6.5925643e-05 |
| 4,713 |
Mining Graph Patterns Efficiently via Randomized Summaries |
2009 |
VLDB |
5.9694403e-05 |
| 5,158 |
Towards Proximity Pattern Mining in Large Graphs |
2010 |
SIGMOD |
5.6510256e-05 |
| 5,447 |
Output Space Sampling for Graph Patterns |
2009 |
VLDB |
5.498563e-05 |
| 5,786 |
Capturing Topology in Graph Pattern Matching |
2012 |
VLDB |
5.3256482e-05 |
| 6,085 |
Answering Top-k Representative Queries on Graph Databases |
2014 |
SIGMOD |
5.2165029e-05 |
| 6,764 |
GAIA: Graph Classification Using Evolutionary Computation |
2010 |
SIGMOD |
4.9287032e-05 |
| 7,615 |
Mining Attribute-structure Correlated Patterns in Large Attributed Graphs |
2012 |
VLDB |
4.6902598e-05 |
| 9,197 |
SkyGraph: Retrieving Regions of Interest using Skyline Subgraph Queries |
2017 |
VLDB |
4.3723013e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,321 |
Mining Top-K Large Structural Patterns in a Massive Network |
2011 |
VLDB |
6.2821897e-05 |
| 10,852 |
Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds |
2025 |
VLDB |
4.1905499e-05 |
| 4,341 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
6.268429e-05 |
| 3,485 |
CSV: Visualizing and Mining Cohesive Subgraphs |
2008 |
SIGMOD |
7.0470365e-05 |
| 4,713 |
Mining Graph Patterns Efficiently via Randomized Summaries |
2009 |
VLDB |
5.9694403e-05 |
| 10,689 |
Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory |
2025 |
VLDB |
4.1905499e-05 |
| 5,903 |
Diversified Top-k Subgraph Querying in a Large Graph |
2016 |
SIGMOD |
5.2757528e-05 |
| 2,913 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9229304e-05 |
| 4,391 |
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks |
2017 |
VLDB |
6.2190075e-05 |
| 7,615 |
Mining Attribute-structure Correlated Patterns in Large Attributed Graphs |
2012 |
VLDB |
4.6902598e-05 |