Aligning Multiple Knowledge Graphs in a Single Pass

• URL: http://arxiv.org/abs/2408.00662v2
• Date: Tue, 11 Feb 2025 07:32:30 GMT
• Title: Aligning Multiple Knowledge Graphs in a Single Pass
• Authors: Yaming Yang, Zhe Wang, Ziyu Guan, Wei Zhao, Weigang Lu, Xinyan Huang, Jiangtao Cui, Xiaofei He,
• Abstract summary: We propose an effective framework named MultiEA to solve the problem of aligning multiple knowledge graphs. In particular, we propose an innovative inference enhancement technique to improve the alignment performance. The results show that our MultiEA can effectively and efficiently align multiple KGs in a single pass.
• Score: 22.193444864399048
• License:
• Abstract: Entity alignment (EA) is to identify equivalent entities across different knowledge graphs (KGs), which can help fuse these KGs into a more comprehensive one. Previous EA methods mainly focus on aligning a pair of KGs, and to the best of our knowledge, no existing EA method considers aligning multiple (more than two) KGs. To fill this research gap, in this work, we study a novel problem of aligning multiple KGs and propose an effective framework named MultiEA to solve the problem. First, we embed the entities of all the candidate KGs into a common feature space by a shared KG encoder. Then, we explore three alignment strategies to minimize the distances among pre-aligned entities. In particular, we propose an innovative inference enhancement technique to improve the alignment performance by incorporating high-order similarities. Finally, to verify the effectiveness of MultiEA, we construct two new real-world benchmark datasets and conduct extensive experiments on them. The results show that our MultiEA can effectively and efficiently align multiple KGs in a single pass. We release the source codes of MultiEA at: https://github.com/kepsail/MultiEA.

Related papers

• Unifying Dual-Space Embedding for Entity Alignment via Contrastive Learning [11.832241823907177]
  We propose UniEA, which unifies dual-space embedding to preserve the intrinsic structure of knowledge graphs (KGs) Our method achieves state-of-the-art performance in structure-based EA.
  arXiv  Detail & Related papers  (2024-12-06T13:25:09Z)
• DERA: Dense Entity Retrieval for Entity Alignment in Knowledge Graphs [3.500936203815729]
  We propose a dense entity retrieval framework for Entity Alignment (EA) We leverage language models to uniformly encode various features of entities and facilitate nearest entity search across Knowledge Graphs (KGs) Our approach achieves state-of-the-art performance compared to existing EA methods.
  arXiv  Detail & Related papers  (2024-08-02T10:12:42Z)
• On the Sweet Spot of Contrastive Views for Knowledge-enhanced Recommendation [49.18304766331156]
  We propose a new contrastive learning framework for KG-enhanced recommendation. We construct two separate contrastive views for KG and IG, and maximize their mutual information. Extensive experimental results on three real-world datasets demonstrate the effectiveness and efficiency of our method.
  arXiv  Detail & Related papers  (2023-09-23T14:05:55Z)
• LightEA: A Scalable, Robust, and Interpretable Entity Alignment Framework via Three-view Label Propagation [27.483109233276632]
  We argue that existing GNN-based EA methods inherit the inborn defects from their neural network lineage: weak scalability and poor interpretability. We propose a non-neural EA framework -- LightEA, consisting of three efficient components: (i) Random Orthogonal Label Generation, (ii) Three-view Label propagation, and (iii) Sparse Sinkhorn Iteration. According to the extensive experiments on public datasets, LightEA has impressive scalability, robustness, and interpretability.
  arXiv  Detail & Related papers  (2022-10-19T10:07:08Z)
• Dangling-Aware Entity Alignment with Mixed High-Order Proximities [65.53948800594802]
  dangling-aware entity alignment is an underexplored but important problem in knowledge graphs. We propose a framework using mixed high-order proximities on dangling-aware entity alignment. Our framework more precisely detects dangling entities, and better aligns matchable entities.
  arXiv  Detail & Related papers  (2022-05-05T02:39:55Z)
• Multilingual Knowledge Graph Completion with Self-Supervised Adaptive Graph Alignment [69.41986652911143]
  We propose a novel self-supervised adaptive graph alignment (SS-AGA) method to predict missing facts in a knowledge graph (KG) SS-AGA fuses all KGs as a whole graph by regarding alignment as a new edge type. Experiments on the public multilingual DBPedia KG and newly-created industrial multilingual E-commerce KG empirically demonstrate the effectiveness of SS-AGA.
  arXiv  Detail & Related papers  (2022-03-28T18:00:51Z)
• ActiveEA: Active Learning for Neural Entity Alignment [31.212894129845093]
  Entity alignment (EA) aims to match equivalent entities across different Knowledge Graphs (KGs) Current mainstream methods -- neural EA models -- rely on training with seed alignment, i.e., a set of pre-aligned entity pairs. We devise a novel Active Learning (AL) framework for neural EA, aiming to create highly informative seed alignment.
  arXiv  Detail & Related papers  (2021-10-13T03:38:04Z)
• Exploring and Evaluating Attributes, Values, and Structures for Entity Alignment [100.19568734815732]
  Entity alignment (EA) aims at building a unified Knowledge Graph (KG) of rich content by linking the equivalent entities from various KGs. attribute triples can also provide crucial alignment signal but have not been well explored yet. We propose to utilize an attributed value encoder and partition the KG into subgraphs to model the various types of attribute triples efficiently.
  arXiv  Detail & Related papers  (2020-10-07T08:03:58Z)
• Cross-lingual Entity Alignment with Incidental Supervision [76.66793175159192]
  We propose an incidentally supervised model, JEANS, which jointly represents multilingual KGs and text corpora in a shared embedding scheme. Experiments on benchmark datasets show that JEANS leads to promising improvement on entity alignment with incidental supervision.
  arXiv  Detail & Related papers  (2020-05-01T01:53:56Z)
• Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization [96.1052289276254]
  We consider the maximum-a-posteriori inference problem in discrete graphical models and study solvers based on the dual block-coordinate ascent rule. We map all existing solvers in a single framework, allowing for a better understanding of their design principles.
  arXiv  Detail & Related papers  (2020-04-16T15:49:13Z)

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.