Towards Proximity Pattern Mining in Large Graphs
Summary: Proximity patterns: neighborhood-label co-occurrence, a relaxed alternative to frequent subgraphs blending itemset efficiency with graph proximity. NmPA transforms graph mining to probabilistic itemset mining solvable by pFP, enabling scalable discovery on large networks and exposing patterns ignored by previous work. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Arijit Khan (University of California Santa Barbara)
- 2. Xifeng Yan (University of California Santa Barbara)
- 3. Kun-Lung Wu (IBM)
BibTeX Citation
@inproceedings{khan_sigmod10,
title = {{Towards Proximity Pattern Mining in Large Graphs}},
author = {Khan, Arijit and Yan, Xifeng and Wu, Kun-Lung},
series = {{SIGMOD} '10},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1807167.1807261},
url = {https://dl.acm.org/doi/10.1145/1807167.1807261},
year = {2010}
}
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,085 | GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph | 2014 | VLDB | 0.0001225302 |
| 1,394 | Neighborhood Based Fast Graph Search in Large Networks | 2011 | SIGMOD | 0.0001093153 |
| 7,466 | Mining Attribute-structure Correlated Patterns in Large Attributed Graphs | 2012 | VLDB | 5.6104855e-05 |
| 8,206 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB | 5.4666548e-05 |
| 9,149 | Semantic SPARQL Similarity Search Over RDF Knowledge Graphs | 2016 | VLDB | 5.3134506e-05 |
| 9,665 | ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs | 2020 | VLDB | 5.2406724e-05 |
| 12,327 | Measuring Two-Event Structural Correlations on Graphs | 2012 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13 | Mining Association Rules between Sets of Items in Large Databases | 1993 | SIGMOD | 0.0006567919 |
| 27 | Fast Algorithms for Mining Association Rules | 1994 | VLDB | 0.00052255472 |
| 161 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00027981772 |
| 177 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00027100548 |
| 326 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00021152829 |
| 727 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB | 0.00014565738 |
| 1,972 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD | 9.3708222e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,206 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB |
| 2 | 9,634 | Fast and Exact Outlier Detection in Metric Spaces: A Proximity Graph-based Approach | 2021 | SIGMOD |
| 3 | 5,538 | Mining Frequent Patterns with Differential Privacy | 2013 | VLDB |
| 4 | 9,703 | Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs | 2017 | SIGMOD |
| 5 | 8,691 | On Reporting Durable Patterns in Temporal Proximity Graphs | 2024 | PODS |
| 6 | 262 | On Triangulation-based Dense Neighborhood Graph Discovery | 2011 | VLDB |
| 7 | 4,282 | Mining Top-K Large Structural Patterns in a Massive Network | 2011 | VLDB |
| 8 | 4,581 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB |
| 9 | 7,466 | Mining Attribute-structure Correlated Patterns in Large Attributed Graphs | 2012 | VLDB |
| 10 | 4,236 | On Dense Pattern Mining in Graph Streams | 2010 | VLDB |