Mining Top-k Pairs of Correlated Subgraphs in a Large Network

Summary: Introduces correlated subgraph mining, targeting top-k pairs whose instances co-occur nearby—unlike conventional frequent-subgraph mining. Best-first exact/approximate search, top-k pruning, and the on-demand compressed Replica structure enable scalable correlation computation. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: hfbd755536341d256
Venue: VLDB
Year: 2020
Pagerank: 5.3516819e-05
Overall Rank: 8,342 | 43.92%
DOI: 10.14778/3397230.3397245

Incoming Non-self Citations Over Time

Authors

1. Arneish Prateek (Indian Institute of Technology Delhi)
2. Arijit Khan (Nanyang Technological University)
3. Akshit Goyal (Indian Institute of Technology Delhi)
4. Sayan Ranu (Indian Institute of Technology Delhi)

BibTeX Citation

@article{prateek_vldb20,
        title = {{Mining Top-k Pairs of Correlated Subgraphs in a Large Network}},
        author = {Prateek, Arneish and Khan, Arijit and Goyal, Akshit and Ranu, Sayan},
        journal = {PVLDB},
        series = {{VLDB} '20},
        volume = {13},
        number = {9},
        pages = {1511--1524},
        doi = {10.14778/3397230.3397245},
        url = {https://doi.org/10.14778/3397230.3397245},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,891	Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds	2025	VLDB	5.2559789e-05
11,722	Closest Pairs Search Over Data Stream	2023	SIGMOD	4.9793485e-05
11,891	Answering Regular Path Queries through Exemplars	2022	VLDB	4.9793485e-05

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
29	Fast Algorithms for Mining Association Rules	1994	VLDB	0.0005121339
1,027	GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph	2014	VLDB	0.00012422544
1,148	Graph Pattern Matching: From Intractable to Polynomial Time	2010	VLDB	0.00011809728
1,374	Neighborhood Based Fast Graph Search in Large Networks	2011	SIGMOD	0.00010880336
2,010	Mining Significant Graph Patterns by Leap Search	2008	SIGMOD	9.1914756e-05
2,235	NeMa: Fast Graph Search with Label Similarity	2013	VLDB	8.7779518e-05
2,773	Graph Homomorphism Revisited for Graph Matching	2010	VLDB	8.0351713e-05
3,116	VIIQ: Auto-Suggestion Enabled Visual Interface for Interactive Graph Query Formulation	2015	VLDB	7.6338057e-05
3,196	Assessing and Ranking Structural Correlations in Graphs	2011	SIGMOD	7.5460261e-05
3,498	COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks	2015	SIGMOD	7.2551144e-05
4,647	Mining Graph Patterns Efficiently via Randomized Summaries	2009	VLDB	6.4867875e-05
5,478	Towards Proximity Pattern Mining in Large Graphs	2010	SIGMOD	6.1142386e-05
5,605	Capturing Topology in Graph Pattern Matching	2012	VLDB	6.0695806e-05
5,729	Output Space Sampling for Graph Patterns	2009	VLDB	6.0157118e-05
6,027	Answering Top-k Representative Queries on Graph Databases	2014	SIGMOD	5.9112117e-05
6,773	GAIA: Graph Classification Using Evolutionary Computation	2010	SIGMOD	5.6860134e-05
7,606	Mining Attribute-structure Correlated Patterns in Large Attributed Graphs	2012	VLDB	5.4849858e-05
9,534	SkyGraph: Retrieving Regions of Interest using Skyline Subgraph Queries	2017	VLDB	5.1636848e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	4,350	Mining Top-K Large Structural Patterns in a Massive Network	2011	VLDB
2	8,891	Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds	2025	VLDB
3	3,902	CSV: Visualizing and Mining Cohesive Subgraphs	2008	SIGMOD
4	3,789	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD
5	4,647	Mining Graph Patterns Efficiently via Randomized Summaries	2009	VLDB
6	11,321	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB
7	5,477	Diversified Top-k Subgraph Querying in a Large Graph	2016	SIGMOD
8	2,042	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB
9	4,091	When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks	2017	VLDB
10	7,606	Mining Attribute-structure Correlated Patterns in Large Attributed Graphs	2012	VLDB