Multi-hop knowledge graph (KG) reasoning is an effective and explainable method for predicting the target entity via reasoning paths in query answering (QA) task. Most previous methods assume that every relation in KGs has enough training triples, regardless of those few-shot relations which cannot provide sufficient triples for training robust reasoning models. In fact, the performance of existing multi-hop reasoning methods drops significantly on few-shot relations. In this paper, we propose a meta-based multi-hop reasoning method (Meta-KGR), which adopts meta-learning to learn effective meta parameters from high-frequency relations that could quickly adapt to few-shot relations. We evaluate Meta-KGR on two public datasets sampled from Freebase and NELL, and the experimental results show that Meta-KGR outperforms the current state-of-the-art methods in few-shot scenarios. Our code and datasets can be obtained from https://github.com/ THU-KEG/MetaKGR.
翻译:多霍普知识图(KG)推理是一个有效且可解释的方法,用于通过解答(QA)任务中的推理路径预测目标实体。大多数先前的方法假定,所有KGs的关系都有足够的培训三重,而不管这些少发关系不能为培训稳健的推理模型提供足够的三重关系。事实上,现有的多霍普推理方法在几发关系上显著下降。在本文中,我们提出了一个基于元的多霍推理方法(Meta-KGR),它采用元学习方法,从高频关系中学习有效的元参数,从而可以迅速适应几发关系。我们用Freebase和NELL的两个抽样公共数据集对Meta-KGR进行评估,实验结果显示,Meta-KGR在几发情景中超越了当前最先进的方法。我们的代码和数据集可以从 https://github.com/ THU-KEG/MetaKGR获得。