Few-shot Knowledge Graph (KG) completion is a focus of current research, where each task aims at querying unseen facts of a relation given its few-shot reference entity pairs. Recent attempts solve this problem by learning static representations of entities and references, ignoring their dynamic properties, i.e., entities may exhibit diverse roles within task relations, and references may make different contributions to queries. This work proposes an adaptive attentional network for few-shot KG completion by learning adaptive entity and reference representations. Specifically, entities are modeled by an adaptive neighbor encoder to discern their task-oriented roles, while references are modeled by an adaptive query-aware aggregator to differentiate their contributions. Through the attention mechanism, both entities and references can capture their fine-grained semantic meanings, and thus render more expressive representations. This will be more predictive for knowledge acquisition in the few-shot scenario. Evaluation in link prediction on two public datasets shows that our approach achieves new state-of-the-art results with different few-shot sizes.
翻译:少见的知识图(KG)的完成是当前研究的一个焦点,其中每项任务的目的是根据一对少见的参考实体来查询一个关系的隐蔽事实。最近试图通过学习实体和参考的静态表达方式来解决这个问题,忽略其动态特性,即实体在任务关系中可能发挥不同作用,而引用可能为查询作出不同的贡献。这项工作建议通过学习适应性实体和参考表达方式,为几发KG的完成建立一个适应性关注网络。具体地说,各实体以一个适应性邻居编码器为模型,以辨别其任务导向的作用,而参考则以适应性查询聚合器为模型,以区分其贡献。通过注意机制,两个实体和引用可以捕捉其细微的语义含义,从而作出更清晰的表达。这将更能预测在微小的情景中获取知识。对两个公共数据集的链接预测评价表明,我们的方法取得了不同大小的新的状态结果。