Knowledge graph completion (KGC) aims to predict the missing links among knowledge graph (KG) entities. Though various methods have been developed for KGC, most of them can only deal with the KG entities seen in the training set and cannot perform well in predicting links concerning novel entities in the test set. Similar problem exists in temporal knowledge graphs (TKGs), and no previous temporal knowledge graph completion (TKGC) method is developed for modeling newly-emerged entities. Compared to KGs, TKGs require temporal reasoning techniques for modeling, which naturally increases the difficulty in dealing with novel, yet unseen entities. In this work, we focus on the inductive learning of unseen entities' representations on TKGs. We propose a few-shot out-of-graph (OOG) link prediction task for TKGs, where we predict the missing entities from the links concerning unseen entities by employing a meta-learning framework and utilizing the meta-information provided by only few edges associated with each unseen entity. We construct three new datasets for TKG few-shot OOG link prediction, and we propose a model that mines the concept-aware information among entities. Experimental results show that our model achieves superior performance on all three datasets and our concept-aware modeling component demonstrates a strong effect.
翻译:知识图的完成(KGC)旨在预测知识图实体之间缺失的环节。虽然已经为KGC开发了各种方法,但大多数方法只能与在培训组中看到的KG实体打交道,无法很好地预测测试组中新实体的联系。时间知识图(TKGs)也存在类似的问题,以前没有为新出现实体的建模开发过时间知识图完成(TKGC)方法。与KGs相比,TKGs需要时间推理模型技术,这自然增加了与新颖但看不见的实体打交道的难度。在这项工作中,我们把重点放在隐蔽实体在TKGs的表述中的初始学习上。我们提出了将TKGs的预测任务(OGs)连接起来的微小点(OOGs),我们通过使用元学习框架和利用与每个无形实体相关的少数边缘提供的元信息,预测了与隐形实体有关的缺失的实体的缺失实体。我们为TKG少发的OG链接模型建造了三个新的数据集,这自然增加了与新实体在TKGs-OGs链接模型上出现的难度。我们建议了对未知实体在TKSOGs的演示过程中的演示,我们提出了一种高级概念模型中显示我们所有业绩效果的模型的模型的模型。