Embedding Learning with Triple Trustiness on Noisy Knowledge Graph

• Main Authors: Yu Zhao, Huali Feng, Patrick Gallinari
• Format: Article
• Language: English
• Published: MDPI AG 2019-11-01
• Series: Entropy
• Subjects: knowledge graph; embedding learning; cross entropy; noise detection; triple trustiness
• Online Access: https://www.mdpi.com/1099-4300/21/11/1083

Embedding learning on knowledge graphs (KGs) aims to encode all entities and relationships into a continuous vector space, which provides an effective and flexible method to implement downstream knowledge-driven artificial intelligence (AI) and natural language processing (NLP) tasks. Since KG construction usually involves automatic mechanisms with less human supervision, it inevitably brings in plenty of noises to KGs. However, most conventional KG embedding approaches inappropriately assume that all facts in existing KGs are completely correct and ignore noise issues, which brings about potentially serious errors. To address this issue, in this paper we propose a novel approach to learn embeddings with <b>triple trustiness</b> on KGs, which takes possible noises into consideration. Specifically, we calculate the trustiness value of triples according to the rich and relatively reliable information from large amounts of entity type instances and entity descriptions in KGs. In addition, we present a cross-entropy based loss function for model optimization. In experiments, we evaluate our models on KG noise detection, KG completion and classification. Through extensive experiments on three datasets, we demonstrate that our proposed model can learn better embeddings than all baselines on noisy KGs.