Hierarchical feature-guided prototypical network for few-shot knowledge graph completion

Abstract

Few-shot knowledge graph completion (FKGC) aims to predict missing triples for unseen relations by observing several associated reference entity pairs. Current methods address this task by learning relation prototypes from the direct neighborhoods of corresponding reference pairs and then computing the feature similarity between the relation prototype and query triples. However, exploiting only direct neighborhoods of entities may lose some representative entity features, leading to unreliable relation prototypes. Moreover, existing methods usually assume that all feature dimensions of entities contribute equally to calculating feature similarity, ignoring the different roles of entity features in dealing with different task relations. To solve these issues, we propose a novel hierarchical feature-guided prototypical network (HPNet) for few-shot knowledge graph completion. HPNet consists of two main components: a hierarchical neighbor encoder to capture more abundant entity features by simultaneously incorporating direct and distant neighborhood information, and a feature-guided prototype learner to compare query triples with relation prototypes along task-relevant feature dimensions by considering different importance of entity features. In this way, our model is able to generate more reliable prototypes and make comparisons in a more effective manner. Extensive comparisons to related works demonstrate the superiority of the proposed HPNet.

Keywords: Few-shot knowledge graph completion; Few-shot learning; Knowledge graph completion; Prototype learning.