Knowledge Inference Combining Convolutional Feature Extraction and Path Semantics Integration

Xinyuan Chen, U. Comite
{"title":"Knowledge Inference Combining Convolutional Feature Extraction and Path Semantics Integration","authors":"Xinyuan Chen, U. Comite","doi":"10.3991/itdaf.v2i1.40095","DOIUrl":null,"url":null,"abstract":"Many knowledge representation models extract local patterns or semantic features using fact embeddings but often overlook path semantics. There is room for improvement in pathbased approaches that rely solely on single paths. A customized convolutional neural network (CNN) architecture is proposed to encode multiple paths generated by random walks into vector sequences. For each path, the feature sequence is then merged into a single vector using bidirectional long short-term memory (LSTM) by concatenating both forward and backward hidden states. Semantic relevance between different paths and candidate relations is computed using the attention mechanism. The state vectors of the relations are calculated using weighted paths. These paths help determine the probabilities of the candidate relations, which are then used to assess the validity of the triples. Link prediction experiments on two benchmark datasets, NELL995 and FB15k-237, demonstrate the advantages of our solution. Our model shows a 7.19% improvement at Hits@3 on FB15k-237 compared to Att-Model + Type, another advanced model. The model is further applied to a large complex dataset, FC17, as well as a sparse dataset, NELL-One, for few-shot reasoning.","PeriodicalId":509615,"journal":{"name":"IETI Transactions on Data Analysis and Forecasting (iTDAF)","volume":"10 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IETI Transactions on Data Analysis and Forecasting (iTDAF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3991/itdaf.v2i1.40095","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Many knowledge representation models extract local patterns or semantic features using fact embeddings but often overlook path semantics. There is room for improvement in pathbased approaches that rely solely on single paths. A customized convolutional neural network (CNN) architecture is proposed to encode multiple paths generated by random walks into vector sequences. For each path, the feature sequence is then merged into a single vector using bidirectional long short-term memory (LSTM) by concatenating both forward and backward hidden states. Semantic relevance between different paths and candidate relations is computed using the attention mechanism. The state vectors of the relations are calculated using weighted paths. These paths help determine the probabilities of the candidate relations, which are then used to assess the validity of the triples. Link prediction experiments on two benchmark datasets, NELL995 and FB15k-237, demonstrate the advantages of our solution. Our model shows a 7.19% improvement at Hits@3 on FB15k-237 compared to Att-Model + Type, another advanced model. The model is further applied to a large complex dataset, FC17, as well as a sparse dataset, NELL-One, for few-shot reasoning.
结合卷积特征提取和路径语义整合的知识推理
许多知识表示模型使用事实嵌入提取局部模式或语义特征,但往往忽略了路径语义。仅依赖单一路径的基于路径的方法还有改进的余地。本文提出了一种定制的卷积神经网络(CNN)架构,可将随机漫步产生的多条路径编码为向量序列。然后,对于每条路径,通过串联前向和后向隐藏状态,使用双向长短期记忆(LSTM)将特征序列合并为单一向量。不同路径和候选关系之间的语义相关性是通过注意力机制计算出来的。使用加权路径计算关系的状态向量。这些路径有助于确定候选关系的概率,然后用于评估三元组的有效性。在 NELL995 和 FB15k-237 这两个基准数据集上进行的链接预测实验证明了我们解决方案的优势。与另一种先进模型 Att-Model + Type 相比,我们的模型在 FB15k-237 的 Hits@3 上提高了 7.19%。我们还将该模型进一步应用于大型复杂数据集 FC17 和稀疏数据集 NELL-One 中,以进行少量推理。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信