PA-GM: Position-Aware Learning of Embedding Networks for Deep Graph Matching
Graph matching can be formalized as a combinatorial optimization problem, where there are corresponding relationships between pairs of nodes that can be represented as edges. This problem becomes challenging when there are potential ambiguities present due to nodes and edges with high similarity, and there is a need to find accurate results for similar content matching. In this paper, we introduce a novel end-to-end neural network that can map the linear assignment problem into a high-dimensional space augmented with node-level relative position information, which is crucial for improving the method's performance for similar content matching. Our model constructs the anchor set for the relative position of nodes and then aggregates the feature information of the target node and each anchor node based on a measure of relative position. It then learns the node feature representation by integrating the topological structure and the relative position information, thus realizing the linear assignment between the two graphs. To verify the effectiveness and generalizability of our method, we conduct graph matching experiments, including cross-category matching, on different real-world datasets. Comparisons with different baselines demonstrate the superiority of our method. Our source code is available under https://github.com/anonymous.
Code (0)
등록된 구현이 없습니다.
Tasks
Combinatorial OptimizationGraph MatchingPositionSimilar Papers 제목 키워드 기반
Knowledge Graph Embedding using Graph Convolutional Networks with Relation-Aware Attention
Knowledge graph embedding methods learn embeddings of entities and relations in a low dimensional space which can be used for various downstream machine learning tasks such as link prediction and entity matching. Various…
Graph AttentionGraph EmbeddingKnowledge Graph EmbeddingLink Prediction+2Hierarchy-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 NetworkGraph Inference Representation: Learning Graph Positional Embeddings with Anchor Path Encoding
Learning node representations that incorporate information from graph structure benefits wide range of tasks on graph. The majority of existing graph neural networks (GNNs) have limited power in capturing position inform…
PositionRepresentation LearningImproving Graph Matching with Positional Reconstruction Encoder-Decoder Network
Deriving from image matching and understanding, semantic keypoint matching aims at establishing correspondence between keypoint sets in images. As graphs are powerful tools to represent points and their complex relations…
Position-aware Graph Neural Networks
Learning node embeddings that capture a node's position within the broader graph structure is crucial for many prediction tasks on graphs. However, existing Graph Neural Network (GNN) architectures have limited power in …
Community DetectionGraph Neural NetworkLink PredictionPosition+1