论文标题
几次知识图完成的分层关系学习
Hierarchical Relational Learning for Few-Shot Knowledge Graph Completion
论文作者
论文摘要
知识图(KGS)在推理能力方面具有强大的功能,但由于其不完整和长尾分布的关系而臭名昭著。为了应对这些挑战并扩大公斤的覆盖范围,很少有kg完成的目的是对涉及新型关系的三胞胎进行预测,而当仅提供了几个培训三胞胎作为参考。以前的方法重点是设计本地邻居聚合器以学习实体级信息和/或在三重态级别施加潜在无效的顺序依赖性假设以学习元关系信息。但是,成对的三胞胎级交互和上下文级别的关系信息已在学习几乎没有射击关系的元表示方面被忽略了。在本文中,我们提出了一种分层的关系学习方法(雇用),以完成几次kg完成。通过共同捕获三个级别的关系信息(实体级别,三胞胎级别和上下文级别),雇用可以有效地学习和完善几乎没有相关关系的元表示,从而很好地推广到新的看不见的关系。基准数据集的广泛实验验证了雇用优于最先进的方法。代码可以在https://github.com/alexhw15/hire.git中找到。
Knowledge graphs (KGs) are powerful in terms of their inference abilities, but are also notorious for their incompleteness and long-tail distribution of relations. To address these challenges and expand the coverage of KGs, few-shot KG completion aims to make predictions for triplets involving novel relations when only a few training triplets are provided as reference. Previous methods have focused on designing local neighbor aggregators to learn entity-level information and/or imposing a potentially invalid sequential dependency assumption at the triplet level to learn meta relation information. However, pairwise triplet-level interactions and context-level relational information have been largely overlooked for learning meta representations of few-shot relations. In this paper, we propose a hierarchical relational learning method (HiRe) for few-shot KG completion. By jointly capturing three levels of relational information (entity-level, triplet-level and context-level), HiRe can effectively learn and refine meta representations of few-shot relations, and thus generalize well to new unseen relations. Extensive experiments on benchmark datasets validate the superiority of HiRe over state-of-the-art methods. The code can be found in https://github.com/alexhw15/HiRe.git.