Entities and Relations Aware Graph Convolutional Network for Knowledge Base Completion

Kun Yang, Haipeng Gao, Y. Yang, Ke Qin
{"title":"Entities and Relations Aware Graph Convolutional Network for Knowledge Base Completion","authors":"Kun Yang, Haipeng Gao, Y. Yang, Ke Qin","doi":"10.1109/icicn52636.2021.9673867","DOIUrl":null,"url":null,"abstract":"Graph Neural Networks (GNNs) have recently been shown to be quite effective in modeling graph-structured data. Recent methods such as RGCN and SACN, have achieved the most advanced results in knowledge graph completion. However, previous efforts are mostly restricted to aggregating information given by neighboring nodes only, ignoring the information given by neighboring edges. This paper proposes a novel Entities and Relations Aware Graph Convolutional Network (ERA-GCN), with an encoder-decoder framework which jointly embeds both entities and relations in a multi-relation graph. In the encoder end, ERA-GCN uses a weighted graph convolutional network to capture both graph structure and neighborhood information. In the decoder end, we utilize Conv-TransE to retain the translational property between entity and relation embedding, leading to better link prediction performance. We evaluate our proposed method on standard FB15k-237 and WNISRR datasets, and achieve about 11% relative improvement compared to current state-of-the-art ConvE in terms of HITS@l, HITS@3 and HITS@10.","PeriodicalId":231379,"journal":{"name":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icicn52636.2021.9673867","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Graph Neural Networks (GNNs) have recently been shown to be quite effective in modeling graph-structured data. Recent methods such as RGCN and SACN, have achieved the most advanced results in knowledge graph completion. However, previous efforts are mostly restricted to aggregating information given by neighboring nodes only, ignoring the information given by neighboring edges. This paper proposes a novel Entities and Relations Aware Graph Convolutional Network (ERA-GCN), with an encoder-decoder framework which jointly embeds both entities and relations in a multi-relation graph. In the encoder end, ERA-GCN uses a weighted graph convolutional network to capture both graph structure and neighborhood information. In the decoder end, we utilize Conv-TransE to retain the translational property between entity and relation embedding, leading to better link prediction performance. We evaluate our proposed method on standard FB15k-237 and WNISRR datasets, and achieve about 11% relative improvement compared to current state-of-the-art ConvE in terms of HITS@l, HITS@3 and HITS@10.
面向实体和关系的知识库补全图卷积网络
图神经网络(gnn)最近被证明在图结构数据建模方面非常有效。最近的方法,如RGCN和SACN,在知识图补全方面取得了最先进的成果。然而,以往的研究大多局限于仅对相邻节点给出的信息进行聚合,而忽略了相邻边给出的信息。本文提出了一种新的感知实体和关系的图卷积网络(ERA-GCN),其编码器-解码器框架将实体和关系共同嵌入到一个多关系图中。在编码器端,ERA-GCN使用加权图卷积网络捕获图结构和邻域信息。在解码器端,我们利用卷积变换来保留实体和关系嵌入之间的转换特性,从而获得更好的链接预测性能。我们在标准的FB15k-237和WNISRR数据集上评估了我们提出的方法,与目前最先进的ConvE相比,在HITS@l, HITS@3和HITS@10方面实现了约11%的相对改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信