.png){kind=icon}
返回
Graph node matching for edit distance
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2024.05.020.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Graphs are commonly used to model interactions between elements of a set, but computing the Graph Edit Distance between two graphs is an NP -complete problem that is particularly challenging for large graphs. To address this problem, we propose a supervised metric learning approach that combines Graph Neural Networks and optimal transport to learn an approximation of the GED in an end -to -end fashion. Our model consists of two siamese GNNs and a comparison block. Each graph pair's nodes are augmented by positional encoding and embedded by multiple Graph Isomorphism Network layers. The obtained embeddings are then compared through a Multi -Layer Perceptron and Linear Sum Assignment Problem solver applied on a nodewise Euclidean metric defined in the embedding space. We show that our approach achieves state-of-the-art results on benchmark datasets and outperforms other similar works in the domain. Our approach also provides explainability through the extraction of an edit path from one graph to another and guarantees metric properties conservation during training and inference.
Keyword:
Graph Neural Network
Graph Edit Distance
Metric learning
Linear Sum Assignment
Node embedding
Siamese architectures
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
Graph partitioning and graph neural network based hierarchical graph matching for graph similarity computation基于图划分和图神经网络的层次图匹配图相似度计算.png)
NEUROCOMPUTING
OAAI
NEUROCOMPUTINGIF6.5
OAAI分享收藏Approximate graph edit distance computation by means of bipartite graph matching通过二分图匹配计算近似图编辑距离
PREAI
分享收藏Hydrothermal preparation and low temperature magnetic properties of TbOOH, DyOOH, HoOOH, ErOOH, and YbOOHTbOOH，DyOOH，HoOOH，ErOOH和YbOOH的水热制备和低温磁性
PREAI
分享收藏
查看更多内容