Mining Statistically Significant Connected Subgraphs in Vertex Labeled Graphs
Summary: Mining statistically significant connected subgraphs in vertex-labeled graphs via chi-square; supports discrete and multi-dimensional continuous labels. Edge contraction creates a super-graph to prune the search; dense graphs yield few super-vertices, sparse graphs trade accuracy for speed, achieving ~96% of optimal chi-square and scalable on real data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Akhil Arora (Indian Institute of Technology Kanpur)
- 2. Mayank Sachan (Indian Institute of Technology Kanpur)
- 3. Arnab Bhattacharya (Indian Institute of Technology Kanpur)
BibTeX Citation
@inproceedings{arora_sigmod14,
title = {{Mining Statistically Significant Connected Subgraphs in Vertex Labeled Graphs}},
author = {Arora, Akhil and Sachan, Mayank and Bhattacharya, Arnab},
series = {{SIGMOD} '14},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2588555.2588574},
url = {https://dl.acm.org/doi/10.1145/2588555.2588574},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 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 |
| 9,665 | ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs | 2020 | VLDB | 5.2406724e-05 |
| 9,685 | GARUDA: A System for Large-Scale Mining of Statistically Significant Connected Subgraphs | 2016 | VLDB | 5.2351356e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,972 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD | 9.3708222e-05 |
| 8,087 | Mining Statistically Significant Substrings using the Chi-Square Statistic | 2012 | VLDB | 5.4904274e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 2 | 2,644 | A Model-based Approach to Attributed Graph Clustering | 2012 | SIGMOD |
| 3 | 364 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB |
| 4 | 10,807 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB |
| 5 | 10,930 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 6 | 8,206 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB |
| 7 | 3,862 | CSV: Visualizing and Mining Cohesive Subgraphs | 2008 | SIGMOD |
| 8 | 8,087 | Mining Statistically Significant Substrings using the Chi-Square Statistic | 2012 | VLDB |
| 9 | 7,466 | Mining Attribute-structure Correlated Patterns in Large Attributed Graphs | 2012 | VLDB |
| 10 | 9,665 | ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs | 2020 | VLDB |