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.
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对时间感知实体对表示进行编码。同时,通过均值池化层聚合生成任务关系的具体表示。此外,该模型将强化学习框架应用于多跳路径补全的全过程,构建策略网络,设计新的奖励函数以实现路径新颖性和长度之间的平衡,并帮助智能体找到最优路径,从而实现少样本情况下的时态知识图谱补全。在训练过程中,使用元学习使模型在少样本情况下能够快速适应新任务。在两个数据集上进行了大量实验以验证模型的有效性。