Simgnn: A Neural Network Approach To Fast Graph Similarity Computation

Abstract

Graph similarity search is among the most important graph-based applications, e.g. finding the chemical compounds that are most similar to a query compound. Graph similarity computation, such as Graph Edit Distance (GED) and Maximum Common Subgraph (MCS), is the core operation of graph similarity search and many other applications, but very costly to compute in practice. Inspired by the recent success of neural network approaches to several graph applications, such as node or graph classification, we propose a novel neural network based approach to address this classic yet challenging graph problem, aiming to alleviate the computational burden while preserving a good performance. The proposed approach, called SimGNN, combines two strategies. First, we design a learnable embedding function that maps every graph into a vector, which provides a global summary of a graph. A novel attention mechanism is proposed to emphasize the important nodes with respect to a specific similarity metric

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keybai2018simgnn

Related papers

• Hierarchical Graph Matching Network For Graph Similarity Computation (2020)0.00
• SEGMN: A Structure-enhanced Graph Matching Network For Graph Similarity Learning (2024)2.26
• S\(^3\)GND: An Effective Learning-based Approach For Subgraph Similarity Search Under Generalized Neighbor Difference Semantics (technical Report) (2026)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
• Explaining Graph Neural Networks For Node Similarity On Graphs (2024)0.00
• Learning-based Efficient Graph Similarity Computation Via Multi-scale Convolutional Set Matching (2018)13.60
• MATA*: Combining Learnable Node Matching With A* Algorithm For Approximate Graph Edit Distance Computation (2023)6.34