Semi-supervised entity alignment via knowledge graph embedding with awareness of degree difference

Shichao Pei, Lu Yu, Robert Hoehndorf, Xiangliang Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations

Abstract

Entity alignment associates entities in different knowledge graphs if they are semantically same, and has been successfully used in the knowledge graph construction and connection. Most of the recent solutions for entity alignment are based on knowledge graph embedding, which maps knowledge entities in a low-dimension space where entities are connected with the guidance of prior aligned entity pairs. The study in this paper focuses on two important issues that limit the accuracy of current entity alignment solutions: 1) labeled data of priorly aligned entity pairs are difficult and expensive to acquire, whereas abundant of unlabeled data are not used; and 2) knowledge graph embedding is affected by entity's degree difference, which brings challenges to align high frequent and low frequent entities. We propose a semi-supervised entity alignment method (SEA) to leverage both labeled entities and the abundant unlabeled entity information for the alignment. Furthermore, we improve the knowledge graph embedding with awareness of the degree difference by performing the adversarial training. To evaluate our proposed model, we conduct extensive experiments on real-world datasets. The experimental results show that our model consistently outperforms the state-of-the-art methods with significant improvement on alignment accuracy.
Original languageEnglish (US)
Title of host publicationThe World Wide Web Conference on - WWW '19
PublisherAssociation for Computing Machinery, Inc
Pages3130-3136
Number of pages7
ISBN (Print)9781450366748
DOIs
StatePublished - May 13 2019

Fingerprint Dive into the research topics of 'Semi-supervised entity alignment via knowledge graph embedding with awareness of degree difference'. Together they form a unique fingerprint.

Cite this