Over the years, reasoning over knowledge graphs (KGs), which aims to infer new conclusions from known facts, has mostly focused on static KGs. The unceasing growth of knowledge in real life raises the necessity to enable the inductive reasoning ability on expanding KGs. Existing inductive work assumes that new entities all emerge once in a batch, which oversimplifies the real scenario that new entities continually appear. This study dives into a more realistic and challenging setting where new entities emerge in multiple batches. We propose a walk-based inductive reasoning model to tackle the new setting. Specifically, a graph convolutional network with adaptive relation aggregation is designed to encode and update entities using their neighboring relations. To capture the varying neighbor importance, we employ a query-aware feedback attention mechanism during the aggregation. Furthermore, to alleviate the sparse link problem of new entities, we propose a link augmentation strategy to add trustworthy facts into KGs. We construct three new datasets for simulating this multi-batch emergence scenario. The experimental results show that our proposed model outperforms state-of-the-art embedding-based, walk-based and rule-based models on inductive KG reasoning.
翻译:多年来,旨在从已知事实中推断新结论的知识图表(KGs)的推理大多侧重于静态的KGs。现实生活中知识的不断增长使得有必要使扩展KGs的推理能力得以扩展。现有的推理工作假设,新实体都会在一个批次中出现,这过度简化了新实体持续出现的真实假设。本研究将一个更现实和更具挑战性的设置,让新实体在多个批次中出现。我们提出了一种基于行进的推理模型来应对新设置。具体地说,一个具有适应关系汇总的图式演动模型网络旨在利用相邻关系对实体进行编码和更新。为了捕捉相邻关系的不同重要性,我们在汇总过程中采用了一个查询-觉反馈关注机制。此外,为了缓解新实体的微小联系问题,我们提议了一个连接增强战略,将可信赖的事实添加到KGs。我们为模拟这种多批次出现情景而设计了三个新的数据集。实验结果显示,我们提议的模型在K-G型嵌入式推理模型上超越了状态。