Machine Learning for Subgraph Extraction: Methods, Applications and Challenges
Summary: Survey of ML-based approaches for subgraph extraction covering subgraph isomorphism, maximum common subgraph, community detection and community search; contrasts learning methods with classical algorithms in efficiency, scalability and effectiveness. Analyzes model designs, empirical performance, applications, datasets and open challenges to guide future database research. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kai Siong Yow (Nanyang Technological University)
- 2. Ningyi Liao (Nanyang Technological University)
- 3. Siqiang Luo (Nanyang Technological University)
- 4. Reynold Cheng (University of Hong Kong)
BibTeX Citation
@article{yow_vldb23,
title = {{Machine Learning for Subgraph Extraction: Methods, Applications and Challenges}},
author = {Yow, Kai Siong and Liao, Ningyi and Luo, Siqiang and Cheng, Reynold},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {12},
pages = {3864--3867},
doi = {10.14778/3611540.3611571},
url = {https://doi.org/10.14778/3611540.3611571},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,067 | Machine Learning for Graph Data Management and Query Processing | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,383 | ICS-GNN: Lightweight Interactive Community Search via Graph Neural Network | 2021 | VLDB | 8.6527736e-05 |
| 2,731 | Neural Subgraph Counting with Wasserstein Estimator | 2022 | SIGMOD | 8.1959181e-05 |
| 2,873 | Query Driven-Graph Neural Networks for Community Search: From Non-Attributed, Attributed, to Interactive Attributed | 2022 | VLDB | 8.0099557e-05 |
| 3,283 | A Learned Sketch for Subgraph Counting | 2021 | SIGMOD | 7.56675e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,644 | A Model-based Approach to Attributed Graph Clustering | 2012 | SIGMOD |
| 2 | 1,181 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB |
| 3 | 3,283 | A Learned Sketch for Subgraph Counting | 2021 | SIGMOD |
| 4 | 5,118 | Efficient Streaming Subgraph Isomorphism with Graph Neural Networks | 2021 | VLDB |
| 5 | 6,149 | Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding | 2024 | VLDB |
| 6 | 10,900 | A Comprehensive Survey and Experimental Study of Learning-based Community Search | 2025 | VLDB |
| 7 | 10,294 | Sublime: Selecting Subgraph Matching Algorithms via Machine Learning | 2026 | SIGMOD |
| 8 | 4,579 | Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions | 2021 | SIGMOD |
| 9 | 11,608 | Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques | 2022 | VLDB |
| 10 | 11,067 | Machine Learning for Graph Data Management and Query Processing | 2025 | VLDB |