Hierarchical Graph Matching Networks for Deep Graph Similarity Learning
While the celebrated graph neural networks yields effective representations for individual nodes of a graph, there has been relatively less success in extending to deep graph similarity learning. Recent work has considered either global-level graph-graph interactions or low-level node-node interactions, ignoring the rich cross-level interactions between parts of a graph and a whole graph. In this paper, we propose a Hierarchical Graph Matching Network (HGMN) for computing the graph similarity between any pair of graph-structured objects. Our model jointly learns graph representations and a graph matching metric function for computing graph similarity in an end-to-end fashion. The proposed HGMN model consists of a multi-perspective node-graph matching network for effectively learning cross-level interactions between parts of a graph and a whole graph, and a siamese graph neural network for learning global-level interactions between two graphs. Our comprehensive experiments demonstrate that our proposed HGMN consistently outperforms state-of-the-art graph matching networks baselines for both classification and regression tasks.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph MatchingGraph Neural NetworkGraph SimilarityMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Hierarchy-Aware Neural Subgraph Matching with Enhanced Similarity Measure
Subgraph matching is challenging as it necessitates time-consuming combinatorial searches. Recent Graph Neural Network (GNN)-based approaches address this issue by employing GNN encoders to extract graph information and …
Graph Neural NetworkResearch on feature fusion and multimodal patent text based on graph attention network
Aiming at the problems of cross-modal feature fusion, low efficiency of long text modeling and lack of hierarchical semantic coherence in patent text semantic mining, this study proposes HGM-Net, a deep learning framewor…
Computational EfficiencyGraph AttentionPatent classificationSentenceGraph Partitioning and Graph Neural Network based Hierarchical Graph Matching for Graph Similarity Computation
Graph similarity computation aims to predict a similarity score between one pair of graphs to facilitate downstream applications, such as finding the most similar chemical compounds similar to a query compound or Fewshot…
3D Action RecognitionAction RecognitionGraph MatchingGraph Neural Network+2HeGMN: Heterogeneous Graph Matching Network for Learning Graph Similarity
Graph similarity learning (GSL), also referred to as graph matching in many scenarios, is a fundamental problem in computer vision, pattern recognition, and graph learning. However, previous GSL methods assume that graph…
Graph LearningGraph MatchingGraph SimilaritySEGMN: A Structure-Enhanced Graph Matching Network for Graph Similarity Learning
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, …
Graph MatchingGraph Similarity