arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.02113cs.CLcs.AIcs.DBcs.IRcs.LG
收藏

从判别到生成:基于生成式Transformer的知识图谱完备

From Discrimination to Generation: Knowledge Graph Completion with Generative Transformer

Zhejiang University(浙江大学);AZFT Joint Lab for Knowledge Engine(AZFT知识引擎联合实验室);Alibaba Group(阿里巴巴集团)

Xin Xie, Ningyu Zhang, Zhoubo Li, Shumin Deng, Hui Chen, Feiyu Xiong, Mosha Chen, Huajun Chen

摘要:

知识图谱完成旨在解决扩展具有缺失三元组的KG的问题。在本文中,我们提供了一种方法GenKGC,它转换知识图谱完成序列到序列生成任务与预先训练的语言模型。我们进一步引入了关系引导的演示和实体感知的分层解码,以实现更好的表示学习和快速推理。在三个数据集上的实验结果表明,该方法可以获得比基线更好或相当的性能,并且与先前使用预训练语言模型的方法相比,可以获得更快的推理速度。我们还发布了一个新的大规模中文知识图谱数据集AliopenKG 500用于研究目的。代码和数据集可在https://github.com/zjunlp/PromptKG/tree/main/GenKGC上获得。

英文摘要:

Knowledge graph completion aims to address the problem of extending a KG with missing triples. In this paper, we provide an approach GenKGC, which converts knowledge graph completion to sequence-to-sequence generation task with the pre-trained language model. We further introduce relation-guided demonstration and entity-aware hierarchical decoding for better representation learning and fast inference. Experimental results on three datasets show that our approach can obtain better or comparable performance than baselines and achieve faster inference speed compared with previous methods with pre-trained language models. We also release a new large-scale Chinese knowledge graph dataset AliopenKG500 for research purpose. Code and datasets are available in https://github.com/zjunlp/PromptKG/tree/main/GenKGC.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑