REA: Robust Cross-lingual Entity Alignment Between Knowledge Graphs
KAUST DepartmentComputer Science
Computer Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Machine Intelligence & kNowledge Engineering Lab
Online Publication Date2020-08-20
Print Publication Date2020-08-23
Permanent link to this recordhttp://hdl.handle.net/10754/664816
MetadataShow full item record
AbstractCross-lingual entity alignment aims at associating semantically similar entities in knowledge graphs with different languages. It has been an essential research problem for knowledge integration and knowledge graph connection, and been studied with supervised or semi-supervised machine learning methods with the assumption of clean labeled data. However, labels from human annotations often include errors, which can largely affect the alignment results. We thus aim to formulate and explore the robust entity alignment problem, which is non-trivial, due to the deficiency of noisy labels. Our proposed method named REA (Robust Entity Alignment) consists of two components: noise detection and noise-aware entity alignment. The noise detection is designed by following the adversarial training principle. The noise-aware entity alignment is devised by leveraging graph neural network based knowledge graph encoder as the core. In order to mutually boost the performance of the two components, we propose a unified reinforced training strategy to combine them. To evaluate our REA method, we conduct extensive experiments on several real-world datasets. The experimental results demonstrate the effectiveness of our proposed method and also show that our model consistently outperforms the state-of-the-art methods with significant improvement on alignment accuracy in the noise-involved scenario.
CitationPei, S., Yu, L., Yu, G., & Zhang, X. (2020). REA: Robust Cross-lingual Entity Alignment Between Knowledge Graphs. Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. doi:10.1145/3394486.3403268
SponsorsThe research reported in this publication was supported by funding from King Abdullah University of Science and Technology (KAUST), under award number URF/1/3756-01-01 and KAUST AI Initiative, and NSFC No. 61828302.