Relational graph convolutional networks: a closer look.

PeerJ Computer Science Pub Date : 2022-11-02 eCollection Date: 2022-01-01 DOI:10.7717/peerj-cs.1073
Thiviyan Thanapalasingam, Lucas van Berkel, Peter Bloem, Paul Groth
{"title":"Relational graph convolutional networks: a closer look.","authors":"Thiviyan Thanapalasingam,&nbsp;Lucas van Berkel,&nbsp;Peter Bloem,&nbsp;Paul Groth","doi":"10.7717/peerj-cs.1073","DOIUrl":null,"url":null,"abstract":"<p><p>In this article, we describe a reproduction of the Relational Graph Convolutional Network (RGCN). Using our reproduction, we explain the intuition behind the model. Our reproduction results empirically validate the correctness of our implementations using benchmark Knowledge Graph datasets on node classification and link prediction tasks. Our explanation provides a friendly understanding of the different components of the RGCN for both users and researchers extending the RGCN approach. Furthermore, we introduce two new configurations of the RGCN that are more parameter efficient. The code and datasets are available at https://github.com/thiviyanT/torch-rgcn.</p>","PeriodicalId":503620,"journal":{"name":"PeerJ Computer Science","volume":" ","pages":"e1073"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9680895/pdf/","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PeerJ Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.7717/peerj-cs.1073","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2022/1/1 0:00:00","PubModel":"eCollection","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In this article, we describe a reproduction of the Relational Graph Convolutional Network (RGCN). Using our reproduction, we explain the intuition behind the model. Our reproduction results empirically validate the correctness of our implementations using benchmark Knowledge Graph datasets on node classification and link prediction tasks. Our explanation provides a friendly understanding of the different components of the RGCN for both users and researchers extending the RGCN approach. Furthermore, we introduce two new configurations of the RGCN that are more parameter efficient. The code and datasets are available at https://github.com/thiviyanT/torch-rgcn.

Abstract Image

Abstract Image

Abstract Image

关系图卷积网络:近距离观察。
在本文中,我们描述了关系图卷积网络(RGCN)的再现。通过我们的再现,我们解释了模型背后的直觉。我们的再现结果在经验上验证了我们在节点分类和链接预测任务上使用基准知识图数据集实现的正确性。我们的解释为扩展RGCN方法的用户和研究人员提供了对RGCN不同组成部分的友好理解。此外,我们还介绍了两种参数效率更高的RGCN新配置。代码和数据集可在https://github.com/thiviyanT/torch-rgcn上获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书