Neural Network Graph Similarity Computation Based on Graph Fusion
Graph similarity learning, crucial for tasks such as graph classification and similarity search, focuses on measuring the similarity between two graph-structured entities. The core challenge in this field is effectively managing the interactions between graphs. Traditional methods often entail separate, redundant computations for each graph pair, leading to unnecessary complexity. This paper revolutionizes the approach by introducing a parallel graph interaction method called graph fusion. By merging the node sequences of graph pairs into a single large graph, our method leverages a global attention mechanism to facilitate interaction computations and to harvest cross-graph insights. We further assess the similarity between graph pairs at two distinct levels-graph-level and node-level-introducing two innovative, yet straightforward, similarity computation algorithms. Extensive testing across five public datasets shows that our model not only outperforms leading baseline models in graph-to-graph classification and regression tasks but also sets a new benchmark for performance and efficiency. The code for this paper is open-source and available at https://github.com/LLiRarry/GFM-code.git
Code (1)
Tasks
Graph ClassificationGraph SimilarityMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Slow Learning and Fast Inference: Efficient Graph Similarity Computation via Knowledge Distillation
Graph Similarity Computation (GSC) is essential to wide-ranging graph applications such as retrieval, plagiarism/anomaly detection, etc. The exact computation of graph similarity, e.g., Graph Edit Distance (GED), is an N…
Anomaly DetectionGraph Neural NetworkGraph SimilarityKnowledge Distillation+2Research 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 classificationSentenceConvolutional Set Matching for Graph Similarity
We introduce GSimCNN (Graph Similarity Computation via Convolutional Neural Networks) for predicting the similarity score between two graphs. As the core operation of graph similarity search, pairwise graph similarity co…
Graph Similarityset matchingLearning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching
Graph similarity computation is one of the core operations in many graph-based applications, such as graph similarity search, graph database analysis, graph clustering, etc. Since computing the exact distance/similarity …
ClusteringCombinatorial OptimizationGraph ClassificationGraph Clustering+3Generating Local Maps of Science using Deep Bibliographic Coupling
Bibliographic and co-citation coupling are two analytical methods widely used to measure the degree of similarity between scientific papers. These approaches are intuitive, easy to put into practice, and computationally …