SEGMN: A Structure-enhanced Graph Matching Network For Graph Similarity Learning

Abstract

Graph similarity computation (GSC) aims to quantify the similarity score between two graphs. Although recent GSC methods based on graph neural networks (GNNs) take advantage of intra-graph structures in message passing, few of them fully utilize the structures presented by edges to boost the representation of their connected nodes. Moreover, previous cross-graph node embedding matching lacks the perception of the overall structure of the graph pair, due to the fact that the node representations from GNNs are confined to the intra-graph structure, causing the unreasonable similarity score. Intuitively, the cross-graph structure represented in the assignment graph is helpful to rectify the inappropriate matching. Therefore, we propose a structure-enhanced graph matching network (SEGMN). Equipped with a dual embedding learning module and a structure perception matching module, SEGMN achieves structure enhancement in both embedding learning and cross-graph matching. The dual embedding lear

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keywang2024segmn

Related papers

• Hierarchical Graph Matching Network For Graph Similarity Computation (2020)0.00
• Simgnn: A Neural Network Approach To Fast Graph Similarity Computation (2018)0.00
• Sub-gmn: The Neural Subgraph Matching Network Model (2021)6.34
• Graph2region: Efficient Graph Similarity Learning With Structure And Scale Restoration (2025)0.00
• Hierarchy-aware Neural Subgraph Matching With Enhanced Similarity Measure (2025)1.20
• S\(^3\)GND: An Effective Learning-based Approach For Subgraph Similarity Search Under Generalized Neighbor Difference Semantics (technical Report) (2026)0.00
• Layoutgmn: Neural Graph Matching For Structural Layout Similarity (2020)9.41
• Learning-based Efficient Graph Similarity Computation Via Multi-scale Convolutional Set Matching (2018)13.60