Large-scale Entity Alignment via Knowledge Graph Merging, Partitioning
and Embedding
- URL: http://arxiv.org/abs/2208.11125v1
- Date: Tue, 23 Aug 2022 07:09:59 GMT
- Title: Large-scale Entity Alignment via Knowledge Graph Merging, Partitioning
and Embedding
- Authors: Kexuan Xin, Zequn Sun, Wen Hua, Wei Hu, Jianfeng Qu, Xiaofang Zhou
- Abstract summary: We propose a scalable GNN-based entity alignment approach to reduce the structure and alignment loss from three perspectives.
First, we propose a centrality-based subgraph generation algorithm to recall some landmark entities serving as the bridges between different subgraphs.
Second, we introduce self-supervised entity reconstruction to recover entity representations from incomplete neighborhood subgraphs.
Third, during the inference process, we merge the embeddings of subgraphs to make a single space for alignment search.
- Score: 29.81122170002021
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Entity alignment is a crucial task in knowledge graph fusion. However, most
entity alignment approaches have the scalability problem. Recent methods
address this issue by dividing large KGs into small blocks for embedding and
alignment learning in each. However, such a partitioning and learning process
results in an excessive loss of structure and alignment. Therefore, in this
work, we propose a scalable GNN-based entity alignment approach to reduce the
structure and alignment loss from three perspectives. First, we propose a
centrality-based subgraph generation algorithm to recall some landmark entities
serving as the bridges between different subgraphs. Second, we introduce
self-supervised entity reconstruction to recover entity representations from
incomplete neighborhood subgraphs, and design cross-subgraph negative sampling
to incorporate entities from other subgraphs in alignment learning. Third,
during the inference process, we merge the embeddings of subgraphs to make a
single space for alignment search. Experimental results on the benchmark OpenEA
dataset and the proposed large DBpedia1M dataset verify the effectiveness of
our approach.
Related papers
- SEG:Seeds-Enhanced Iterative Refinement Graph Neural Network for Entity Alignment [13.487673375206276]
This paper presents a soft label propagation framework that integrates multi-source data and iterative seed enhancement.
A bidirectional weighted joint loss function is implemented, which reduces the distance between positive samples and differentially processes negative samples.
Our method outperforms existing semi-supervised approaches, as evidenced by superior results on multiple datasets.
arXiv Detail & Related papers (2024-10-28T04:50:46Z) - A Plug-and-Play Method for Rare Human-Object Interactions Detection by Bridging Domain Gap [50.079224604394]
We present a novel model-agnostic framework called textbfContext-textbfEnhanced textbfFeature textbfAment (CEFA)
CEFA consists of a feature alignment module and a context enhancement module.
Our method can serve as a plug-and-play module to improve the detection performance of HOI models on rare categories.
arXiv Detail & Related papers (2024-07-31T08:42:48Z) - Distributional Reduction: Unifying Dimensionality Reduction and Clustering with Gromov-Wasserstein [56.62376364594194]
Unsupervised learning aims to capture the underlying structure of potentially large and high-dimensional datasets.
In this work, we revisit these approaches under the lens of optimal transport and exhibit relationships with the Gromov-Wasserstein problem.
This unveils a new general framework, called distributional reduction, that recovers DR and clustering as special cases and allows addressing them jointly within a single optimization problem.
arXiv Detail & Related papers (2024-02-03T19:00:19Z) - EventEA: Benchmarking Entity Alignment for Event-centric Knowledge
Graphs [17.27027602556303]
We show that the progress made in the past was due to biased and unchallenging evaluation.
We construct a new dataset with heterogeneous relations and attributes based on event-centric KGs.
As a new approach to this difficult problem, we propose a time-aware literal encoder for entity alignment.
arXiv Detail & Related papers (2022-11-05T05:34:21Z) - Collaborative Propagation on Multiple Instance Graphs for 3D Instance
Segmentation with Single-point Supervision [63.429704654271475]
We propose a novel weakly supervised method RWSeg that only requires labeling one object with one point.
With these sparse weak labels, we introduce a unified framework with two branches to propagate semantic and instance information.
Specifically, we propose a Cross-graph Competing Random Walks (CRW) algorithm that encourages competition among different instance graphs.
arXiv Detail & Related papers (2022-08-10T02:14:39Z) - DFC: Deep Feature Consistency for Robust Point Cloud Registration [0.4724825031148411]
We present a novel learning-based alignment network for complex alignment scenes.
We validate our approach on the 3DMatch dataset and the KITTI odometry dataset.
arXiv Detail & Related papers (2021-11-15T08:27:21Z) - Index $t$-SNE: Tracking Dynamics of High-Dimensional Datasets with
Coherent Embeddings [1.7188280334580195]
This paper presents a methodology to reuse an embedding to create a new one, where cluster positions are preserved.
The proposed algorithm has the same complexity as the original $t$-SNE to embed new items, and a lower one when considering the embedding of a dataset sliced into sub-pieces.
arXiv Detail & Related papers (2021-09-22T06:45:37Z) - PointFlow: Flowing Semantics Through Points for Aerial Image
Segmentation [96.76882806139251]
We propose a point-wise affinity propagation module based on the Feature Pyramid Network (FPN) framework, named PointFlow.
Rather than dense affinity learning, a sparse affinity map is generated upon selected points between the adjacent features.
Experimental results on three different aerial segmentation datasets suggest that the proposed method is more effective and efficient than state-of-the-art general semantic segmentation methods.
arXiv Detail & Related papers (2021-03-11T09:42:32Z) - RAGA: Relation-aware Graph Attention Networks for Global Entity
Alignment [14.287681294725438]
We propose a novel framework based on Relation-aware Graph Attention Networks to capture the interactions between entities and relations.
Our framework adopts the self-attention mechanism to spread entity information to the relations and then aggregate relation information back to entities.
arXiv Detail & Related papers (2021-03-01T06:30:51Z) - Neighborhood Matching Network for Entity Alignment [71.24217694278616]
Neighborhood Matching Network (NMN) is a novel entity alignment framework.
NMN estimates the similarities between entities to capture both the topological structure and the neighborhood difference.
It first uses a novel graph sampling method to distill a discriminative neighborhood for each entity.
It then adopts a cross-graph neighborhood matching module to jointly encode the neighborhood difference for a given entity pair.
arXiv Detail & Related papers (2020-05-12T08:26:15Z) - High-Order Information Matters: Learning Relation and Topology for
Occluded Person Re-Identification [84.43394420267794]
We propose a novel framework by learning high-order relation and topology information for discriminative features and robust alignment.
Our framework significantly outperforms state-of-the-art by6.5%mAP scores on Occluded-Duke dataset.
arXiv Detail & Related papers (2020-03-18T12:18:35Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.