• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

用于少样本时态知识图谱补全的多跳可解释元学习

Multi-hop interpretable meta learning for few-shot temporal knowledge graph completion.

作者信息

Bai Luyi, Han Shuo, Zhu Lin

机构信息

School of Computer and Communication Engineering, Northeastern University (Qinhuangdao), Qinhuangdao 066004, China.

School of Computer and Communication Engineering, Northeastern University (Qinhuangdao), Qinhuangdao 066004, China.

出版信息

Neural Netw. 2025 Mar;183:106981. doi: 10.1016/j.neunet.2024.106981. Epub 2024 Nov 28.

DOI:10.1016/j.neunet.2024.106981
PMID:39626533
Abstract

Multi-hop path completion is a key part of temporal knowledge graph completion, which aims to infer complex relationships and obtain interpretable completion results. However, the traditional multi-hop path completion models mainly focus on the static knowledge graph with sufficient relationship instances, and does not consider the impact of timestamp information on the completion path, and is not suitable for few-shot relations. These limitations make the performance of these models not good when dealing with few-shot relationships in temporal knowledge graphs. In order to issue these challenges, we propose the Few-shot Temporal knowledge graph completion model based on the Multi-hop Interpretable meta-learning(FTMI). First, by aggregating the multi-hop neighbor information of the task relationship to generate a time-aware entity representation to enhance the task entity representation, the introduction of the timestamp information dimension enables the FTMI model to understand and deal with the impact of time changes on entities and relationships. In addition, time-aware entity pair representations are encoded using Transformer. At the same time, the specific representation of task relationship is generated by means of mean pooling layer aggregation. In addition, the model applies the reinforcement learning framework to the whole process of multi-hop path completion, constructs the strategy network, designs the new reward function to achieve the balance between path novelty and length, and helps Agent find the optimal path, thus realizing the completion of the temporal knowledge graph with few samples. In the training process, meta-learning is used to enable the model to quickly adapt to new tasks in the case of few samples. A huge number of experiments were carried out on two datasets to validate the model's validity.

摘要

多跳路径补全是时态知识图谱补全的关键部分,其旨在推断复杂关系并获得可解释的补全结果。然而,传统的多跳路径补全模型主要关注具有足够关系实例的静态知识图谱,没有考虑时间戳信息对补全路径的影响,不适用于少样本关系。这些局限性使得这些模型在处理时态知识图谱中的少样本关系时性能不佳。为了应对这些挑战,我们提出了基于多跳可解释元学习的少样本时态知识图谱补全模型(FTMI)。首先,通过聚合任务关系的多跳邻居信息来生成时间感知实体表示以增强任务实体表示,时间戳信息维度的引入使FTMI模型能够理解和处理时间变化对实体和关系的影响。此外,使用Transformer对时间感知实体对表示进行编码。同时,通过均值池化层聚合生成任务关系的具体表示。此外,该模型将强化学习框架应用于多跳路径补全的全过程,构建策略网络,设计新的奖励函数以实现路径新颖性和长度之间的平衡,并帮助智能体找到最优路径,从而实现少样本情况下的时态知识图谱补全。在训练过程中,使用元学习使模型在少样本情况下能够快速适应新任务。在两个数据集上进行了大量实验以验证模型的有效性。

相似文献

1
Multi-hop interpretable meta learning for few-shot temporal knowledge graph completion.用于少样本时态知识图谱补全的多跳可解释元学习
Neural Netw. 2025 Mar;183:106981. doi: 10.1016/j.neunet.2024.106981. Epub 2024 Nov 28.
2
Few-shot link prediction for temporal knowledge graphs based on time-aware translation and attention mechanism.基于时间感知翻译和注意力机制的时态知识图谱少样本链接预测
Neural Netw. 2023 Apr;161:371-381. doi: 10.1016/j.neunet.2023.01.043. Epub 2023 Feb 1.
3
Capsule neural tensor networks with multi-aspect information for Few-shot Knowledge Graph Completion.胶囊神经张量网络的多方面信息在少样本知识图谱补全中的应用。
Neural Netw. 2023 Jul;164:323-334. doi: 10.1016/j.neunet.2023.04.041. Epub 2023 May 4.
4
Dual view graph transformer networks for multi-hop knowledge graph reasoning.用于多跳知识图谱推理的双视图图变换器网络
Neural Netw. 2025 Jun;186:107260. doi: 10.1016/j.neunet.2025.107260. Epub 2025 Feb 14.
5
Edge-Aware Graph Neural Network for Multi-Hop Path Reasoning over Knowledge Base.基于边缘感知图神经网络的知识库多跳路径推理
Comput Intell Neurosci. 2022 Oct 12;2022:4734179. doi: 10.1155/2022/4734179. eCollection 2022.
6
Path-based knowledge reasoning with textual semantic information for medical knowledge graph completion.基于路径的知识推理与文本语义信息融合的医疗知识图谱补全方法
BMC Med Inform Decis Mak. 2021 Nov 29;21(Suppl 9):335. doi: 10.1186/s12911-021-01622-7.
7
MuLAN: Multi-level attention-enhanced matching network for few-shot knowledge graph completion.MuLAN:用于少样本知识图谱补全的多级注意力增强匹配网络
Neural Netw. 2024 Jun;174:106222. doi: 10.1016/j.neunet.2024.106222. Epub 2024 Feb 29.
8
MLSFF: Multi-level structural features fusion for multi-modal knowledge graph completion.MLSFF:用于多模态知识图谱补全的多层次结构特征融合
Math Biosci Eng. 2023 Jun 25;20(8):14096-14116. doi: 10.3934/mbe.2023630.
9
Path reliability-based graph attention networks.基于路径可靠性的图注意力网络
Neural Netw. 2023 Feb;159:153-160. doi: 10.1016/j.neunet.2022.11.021. Epub 2022 Nov 19.
10
HiAM: A Hierarchical Attention based Model for knowledge graph multi-hop reasoning.HiAM:一种基于分层注意力的知识图谱多跳推理模型。
Neural Netw. 2021 Nov;143:261-270. doi: 10.1016/j.neunet.2021.06.008. Epub 2021 Jun 9.