TaGSim: Type-aware Graph Similarity Learning and Computation
Summary: TaGSim enables fine-grained GED approximation by separately modeling the transformative effects of node/edge insertions, deletions, and relabelings. Type-aware embeddings and neural estimators deliver accurate, efficient similarity computation, outperforming prior methods on five real-world datasets. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jiyang Bai (Florida State University)
- 2. Peixiang Zhao (Florida State University)
BibTeX Citation
@article{bai_vldb22,
title = {{TaGSim: Type-aware Graph Similarity Learning and Computation}},
author = {Bai, Jiyang and Zhao, Peixiang},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {2},
pages = {335--347},
doi = {10.14778/3489496.3489513},
url = {https://doi.org/10.14778/3489496.3489513},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,423 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB | 7.4260662e-05 |
| 8,126 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD | 5.4827332e-05 |
| 10,524 | A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs | 2026 | VLDB | 5.093636e-05 |
| 10,764 | Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods | 2025 | SIGMOD | 5.093636e-05 |
| 10,939 | Fused Gromov-Wasserstein Alignment for Graph Edit Distance Computation and Beyond | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 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,115 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00012117375 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,756 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 2 | 4,061 | Efficient Top-K SimRank-based Similarity Join | 2015 | VLDB |
| 3 | 11,108 | Efficient Graph Embedding Generation and Update for Large-Scale Temporal Graph | 2025 | VLDB |
| 4 | 10,524 | A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs | 2026 | VLDB |
| 5 | 12,021 | NED: An Inter-Graph Node Metric Based On Edit Distance | 2017 | VLDB |
| 6 | 7,152 | Boosting Graph Similarity Search through Pre-Computation | 2021 | SIGMOD |
| 7 | 10,939 | Fused Gromov-Wasserstein Alignment for Graph Edit Distance Computation and Beyond | 2025 | VLDB |
| 8 | 8,126 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD |
| 9 | 10,764 | Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods | 2025 | SIGMOD |
| 10 | 3,423 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB |