Mconvkgc: a novel multi-channel convolutional model for knowledge graph completion

IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, THEORY & METHODS Computing Pub Date : 2024-01-25 DOI:10.1007/s00607-023-01247-w
Xiaochuan Sun, Qi Chen, Mingxiang Hao, Yingqi Li, Bo Sun
{"title":"Mconvkgc: a novel multi-channel convolutional model for knowledge graph completion","authors":"Xiaochuan Sun, Qi Chen, Mingxiang Hao, Yingqi Li, Bo Sun","doi":"10.1007/s00607-023-01247-w","DOIUrl":null,"url":null,"abstract":"<p>The incompleteness of the knowledge graph limits its applications to various downstream tasks. To this end, numerous influential knowledge graph embedding models have been presented and have made great achievements in the domain of knowledge graph completion. However, most of these models only pay attention to the extraction of latent knowledge or translational features, and cannot comprehensively capture the surface semantics, latent interactions, and translational characteristics of triples. In this paper, a novel multi-channel convolutional model, MConvKGC, is presented for knowledge graph completion, which has three feature extraction channels and employs them to simultaneously extract shallow semantics, latent interactions, and translational characteristics, respectively. In addition, MConvKGC adopts an asymmetric convolutional block to comprehensively extract the latent interactions from triples, and process the generated feature maps with various attention mechanisms to further learn local dependencies between entities and relations. The results of the conducted link prediction experiments on FB15k-237, WN18RR, and UMLS indicate that our proposed MConvKGC shows excellent performance and outperforms previous state-of-the-art KGE models in the majority of cases.</p>","PeriodicalId":10718,"journal":{"name":"Computing","volume":"3 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00607-023-01247-w","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

The incompleteness of the knowledge graph limits its applications to various downstream tasks. To this end, numerous influential knowledge graph embedding models have been presented and have made great achievements in the domain of knowledge graph completion. However, most of these models only pay attention to the extraction of latent knowledge or translational features, and cannot comprehensively capture the surface semantics, latent interactions, and translational characteristics of triples. In this paper, a novel multi-channel convolutional model, MConvKGC, is presented for knowledge graph completion, which has three feature extraction channels and employs them to simultaneously extract shallow semantics, latent interactions, and translational characteristics, respectively. In addition, MConvKGC adopts an asymmetric convolutional block to comprehensively extract the latent interactions from triples, and process the generated feature maps with various attention mechanisms to further learn local dependencies between entities and relations. The results of the conducted link prediction experiments on FB15k-237, WN18RR, and UMLS indicate that our proposed MConvKGC shows excellent performance and outperforms previous state-of-the-art KGE models in the majority of cases.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Mconvkgc:用于完成知识图谱的新型多通道卷积模型
知识图谱的不完整性限制了它在各种下游任务中的应用。为此,人们提出了许多有影响力的知识图谱嵌入模型,并在知识图谱完备领域取得了巨大成就。然而,这些模型大多只关注潜在知识或平移特征的提取,无法全面捕捉三元组的表层语义、潜在交互和平移特征。本文针对知识图谱补全提出了一种新颖的多通道卷积模型 MConvKGC,它有三个特征提取通道,分别用于同时提取浅层语义、潜在交互和平移特征。此外,MConvKGC 还采用非对称卷积块全面提取三元组中的潜在交互,并利用各种注意机制处理生成的特征图,进一步学习实体和关系之间的局部依赖关系。在 FB15k-237、WN18RR 和 UMLS 上进行的链接预测实验结果表明,我们提出的 MConvKGC 表现出色,在大多数情况下都优于之前最先进的 KGE 模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computing
Computing 工程技术-计算机:理论方法
CiteScore
8.20
自引率
2.70%
发文量
107
审稿时长
3 months
期刊介绍: Computing publishes original papers, short communications and surveys on all fields of computing. The contributions should be written in English and may be of theoretical or applied nature, the essential criteria are computational relevance and systematic foundation of results.
期刊最新文献
Mapping and just-in-time traffic congestion mitigation for emergency vehicles in smart cities Fog intelligence for energy efficient management in smart street lamps Contextual authentication of users and devices using machine learning Multi-objective service composition optimization problem in IoT for agriculture 4.0 Robust evaluation of GPU compute instances for HPC and AI in the cloud: a TOPSIS approach with sensitivity, bootstrapping, and non-parametric analysis
×
引用
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