Efficient and Effective Unsupervised Entity Alignment in Large Knowledge Graphs

Entity Alignment (EA) in Knowledge Graphs (KGs) is a crucial task for the integration of multiple KGs, facilitating the amalgamation of multi-source knowledge and enhancing support for downstream applications. In recent years, unsupervised EA methods have demonstrated remarkable efficacy in leveraging graph structures or utilizing auxiliary information. However, the increasing complexity of many modeling methods limits their applicability to large KGs in real-world scenarios. Given that most EA encoders primarily focus on modeling one-hop neighborhoods within the KG’s graph structure while neglecting similarities among multi-hop neighborhoods, we propose an efficient and effective unsupervised EA method, MPGT-Align, based on a multi-hop pruning graph transformer. The core innovation of MPGT-Align lies in mining multi-hop neighborhood features of entities through two components: Pruning-hop2Token and Attention-based Transformer encoder. The former aggregates only those multi-hop neighborhoods that contribute to alignment targets, inspired by search pruning algorithms. The latter empowers MPGT-Align to adaptively extract more effective alignment information from both entity itself and its multi-hop neighbors. Furthermore, Pruning-hop2Token serves as a non-parametric method that not only reduces model parameters, but also allows MPGT-Align to be trained with small batch sizes, thereby enabling efficient handling of large KGs. Extensive experiments conducted across various benchmark datasets demonstrate that our method consistently outperforms most existing supervised and unsupervised EA techniques.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2025-02-13
DOI
https://doi.org/10.3390/app15041976
Citations
1
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient and Effective Unsupervised Entity Alignment in Large Knowledge Graphs

Weishan Cai, Wenjun Ma, Ruqi Zhou
1 citations
Applied Sciences
Advanced Graph Neural Networks
2.48
article

Efficient and Effective Unsupervised Entity Alignment in Large Knowledge Graphs

Weishan Cai, Wenjun Ma, Ruqi Zhou
article en
1 citations

Abstract

Entity Alignment (EA) in Knowledge Graphs (KGs) is a crucial task for the integration of multiple KGs, facilitating the amalgamation of multi-source knowledge and enhancing support for downstream applications. In recent years, unsupervised EA methods have demonstrated remarkable efficacy in leveraging graph structures or utilizing auxiliary information. However, the increasing complexity of many modeling methods limits their applicability to large KGs in real-world scenarios. Given that most EA encoders primarily focus on modeling one-hop neighborhoods within the KG’s graph structure while neglecting similarities among multi-hop neighborhoods, we propose an efficient and effective unsupervised EA method, MPGT-Align, based on a multi-hop pruning graph transformer. The core innovation of MPGT-Align lies in mining multi-hop neighborhood features of entities through two components: Pruning-hop2Token and Attention-based Transformer encoder. The former aggregates only those multi-hop neighborhoods that contribute to alignment targets, inspired by search pruning algorithms. The latter empowers MPGT-Align to adaptively extract more effective alignment information from both entity itself and its multi-hop neighbors. Furthermore, Pruning-hop2Token serves as a non-parametric method that not only reduces model parameters, but also allows MPGT-Align to be trained with small batch sizes, thereby enabling efficient handling of large KGs. Extensive experiments conducted across various benchmark datasets demonstrate that our method consistently outperforms most existing supervised and unsupervised EA techniques.

Applied SciencesVol. 15(4)
South China Normal University (CN), Guangdong University of Education (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 12%
Advanced Graph Neural Networks
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.