A structure-enhanced generative adversarial network for knowledge graph zero-shot relational learning

Most knowledge graph completion methods focus on predicting existing relationships in the knowledge graph but cannot predict unseen relationships. To solve this problem, knowledge graph zero-shot relational learning (KGZSL) has gotten more and more attention in recent years. The common method of KGZ...

Full description

Saved in:
Bibliographic Details
Published in:Information sciences Vol. 629; pp. 169 - 183
Main Authors: Li, Xuewei, Ma, Jinming, Yu, Jian, Zhao, Mankun, Yu, Mei, Liu, Hongwei, Ding, Weiping, Yu, Ruiguo
Format: Journal Article
Language:English
Published: Elsevier Inc 01.06.2023
Subjects:
ISSN:0020-0255, 1872-6291
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Most knowledge graph completion methods focus on predicting existing relationships in the knowledge graph but cannot predict unseen relationships. To solve this problem, knowledge graph zero-shot relational learning (KGZSL) has gotten more and more attention in recent years. The common method of KGZSL is to leverage Generative Adversarial Networks (GANs) to build the connection between existing relation descriptions and knowledge graph domains. However, the traditional KGZSL method ignores the gap between relation text description and relation structured representation. To bridge this gap, we propose a Structure-Enhanced Generative Adversarial Network (SEGAN). SEGAN adopts a structure encoder to introduce knowledge graph structure information into the generator and guide the generator to generate knowledge graph embeddings more accurately. In addition, in the KGZSL task, the representations of entities are closely tied to the existing relationships, which has a negative impact on the prediction of new instances. Therefore, we design a new plug-and-play feature encoder to decouple entities from existing relationships. Experimental results on the knowledge graph zero-shot relational learning dataset demonstrate that our method has better structure representation ability, and the model performance is improved by 36.3% compared with the current optimal model.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2023.01.113