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
- 2. Mayank Sachan
- 3. Arnab Bhattacharya
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,974 | ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks | 2016 | SIGMOD | 4.8780906e-05 |
| 9,575 | GARUDA: A System for Large-Scale Mining of Statistically Significant Connected Subgraphs | 2016 | VLDB | 4.325244e-05 |
| 9,580 | ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs | 2020 | VLDB | 4.3234342e-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,747 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD | 0.00010691242 |
| 7,737 | Mining Statistically Significant Substrings using the Chi-Square Statistic | 2012 | VLDB | 4.6642145e-05 |
Previous
Page 1 / 1
Next