Attention-Based Relational Graph Convolutional Network for Knowledge Graph Reasoning

Junhua Duan, Yucheng Huang, Zhu Yi-an, Dong Zhong
{"title":"Attention-Based Relational Graph Convolutional Network for Knowledge Graph Reasoning","authors":"Junhua Duan, Yucheng Huang, Zhu Yi-an, Dong Zhong","doi":"10.1109/ISCIT55906.2022.9931190","DOIUrl":null,"url":null,"abstract":"In recent years, with the rapid growth of knowledge graphs, knowledge reasoning technology is in great demand for research. The knowledge graph is a heterogeneous network with a graph structure. Graph Convolutional Network (GCN) is an extension of traditional Convolutional Neural Network (CNN) in non-Euclidean space, very suitable for processing complex graph data. In this paper, a attention-based relational graph convolutional network (AR-GCN) is proposed. When aggregating neighbor information, the weight of neighbor nodes is adaptively assigned through the attention mechanism, so that nodes can focus on different neighbor information and enhance the accuracy of feature representation. According to the topological characteristics of different knowledge graphs, two attention mechanisms are proposed. The experimental results show that AR-GCN outperforms R-GCN in entity classification and link prediction tasks, further showing that it has stronger characterization ability.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"257 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT55906.2022.9931190","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In recent years, with the rapid growth of knowledge graphs, knowledge reasoning technology is in great demand for research. The knowledge graph is a heterogeneous network with a graph structure. Graph Convolutional Network (GCN) is an extension of traditional Convolutional Neural Network (CNN) in non-Euclidean space, very suitable for processing complex graph data. In this paper, a attention-based relational graph convolutional network (AR-GCN) is proposed. When aggregating neighbor information, the weight of neighbor nodes is adaptively assigned through the attention mechanism, so that nodes can focus on different neighbor information and enhance the accuracy of feature representation. According to the topological characteristics of different knowledge graphs, two attention mechanisms are proposed. The experimental results show that AR-GCN outperforms R-GCN in entity classification and link prediction tasks, further showing that it has stronger characterization ability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于注意力的关系图卷积网络知识图推理
近年来,随着知识图谱的快速发展,知识推理技术的研究需求越来越大。知识图谱是一种具有图结构的异构网络。图卷积网络(Graph Convolutional Network, GCN)是传统卷积神经网络(Convolutional Neural Network, CNN)在非欧空间的扩展,非常适合处理复杂的图数据。本文提出了一种基于注意的关系图卷积网络(AR-GCN)。在聚合邻居信息时,通过关注机制自适应分配邻居节点的权值,使节点能够关注不同的邻居信息,提高特征表示的准确性。根据不同知识图的拓扑特征,提出了两种注意机制。实验结果表明,AR-GCN在实体分类和链路预测任务上优于R-GCN,进一步表明其具有更强的表征能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Running Pace Adjustment and Training Distance Fitting with Fuzzy Logic and Machine Learning Low Quality Samples Detection in Motor Imagery EEG Data by Combining Independent Component Analysis and Confident Learning Application and Certification Mechanism of Active Identification Carrier in the Industrial Internet Fuzzy Logic Based Agent Selection for Failure Management in VANETs A Knowledge- Distillation - Integrated Pruning Method for Vision Transformer
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1