Multilevel Graph Matching Networks for Deep Graph Similarity Learning

Abstract

While the celebrated graph neural networks yield effective representations for individual nodes of a graph, there has been relatively less success in extending to the task of graph similarity learning. Recent work on graph similarity learning has considered either global-level graph-graph interactions or low-level node-node interactions, however ignoring the rich cross-level interactions (e.g., between each node of one graph and the other whole graph). In this paper, we propose a multi-level graph matching network (MGMN) framework for computing the graph similarity between any pair of graph-structured objects in an end-to-end fashion. In particular, the proposed MGMN consists of a node-graph matching network for effectively learning cross-level interactions between each node of one graph and the other whole graph, and a siamese graph neural network to learn global-level interactions between two input graphs. Furthermore, to compensate for the lack of standard benchmark datasets, we have created and collected a set of datasets for both the graph-graph classification and graph-graph regression tasks with different sizes in order to evaluate the effectiveness and robustness of our models. Comprehensive experiments demonstrate that MGMN consistently outperforms state-of-the-art baseline models on both the graph-graph classification and graph-graph regression tasks. Compared with previous work, MGMN also exhibits stronger robustness as the sizes of the two input graphs increase.

arXiv commentAccepted by IEEE Transactions on Neural Networks and Learning Systems (IEEE TNNLS)

References in corpus (18)

• Adam: A Method for Stochastic Optimization
• PyTorch: An Imperative Style, High-Performance Deep Learning Library
• A Comprehensive Survey on Graph Neural Networks
• Inductive Representation Learning on Large Graphs
• Geometric deep learning: going beyond Euclidean data
• Fast Graph Representation Learning with PyTorch Geometric
• Adversarial Attacks on Neural Networks for Graph Data
• Hierarchical Graph Representation Learning with Differentiable Pooling
• Neural Network-based Graph Embedding for Cross-Platform Binary Code Similarity Detection
• GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models
• Learning Deep Generative Models of Graphs
• Self-Attention Graph Pooling
• Graph Matching Networks for Learning the Similarity of Graph Structured Objects
• Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddings
• GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoders
• Deep Graph Matching and Searching for Semantic Code Retrieval
• D2KE: From Distance to Kernel and Embedding
• Scalable Global Alignment Graph Kernel Using Random Features: From Node Embedding to Graph Embedding

Cited by in corpus (5)

• Adversarial Attacks against Windows PE Malware Detection: A Survey of the State-of-the-Art
• Deep Graph Matching and Searching for Semantic Code Retrieval
• SGMNet: Scene Graph Matching Network for Few-Shot Remote Sensing Scene Classification
• Finding Counterfactual Evidences for Node Classification
• GIMS: Image Matching System Based on Adaptive Graph Construction and Graph Neural Network