Application of concepts of neighbours to knowledge graph completion

Data Science

article

Sébastien Ferré¹ 

[1] Univ Rennes

关键词: Knowledge Graph;    multi-relational data;    knowledge graph completion;    link prediction;    graph pattern;    Concepts of Nearest Neighbours;    inference rules;    analogical inference;    explainable AI;   

DOI  :  10.3233/DS-200030

来源: IOS Press

【 摘 要 】

The open nature of Knowledge Graphs (KG) often implies that they are incomplete. Knowledge graph completion (a.k.a. link prediction) consists in inferring new relationships between the entities of a KG based on existing relationships. Most existing approaches rely on the learning of latent feature vectors for the encoding of entities and relations. In general however, latent features cannot be easily interpreted. Rule-based approaches offer interpretability but a distinct ruleset must be learned for each relation. In both latent- and rule-based approaches, the training phase has to be run again when the KG is updated. We propose a new approach that does not need a training phase, and that can provide interpretable explanations for each inference. It relies on the computation of Concepts of Nearest Neighbours (C-NN) to identify clusters of similar entities based on common graph patterns. Different rules are then derived from those graph patterns, and combined to predict new relationships. We evaluate our approach on standard benchmarks for link prediction, where it gets competitive performance compared to existing approaches.

【 授权许可】

Unknown