Learning Context-based Embeddings for Knowledge Graph Completion

Purpose: Due to the incompleteness nature of knowledge graphs(KGs), the task of predicting missing links between entities becomes important. Many previous approaches are static, this posed a notable problem that all meanings of a polysemous entity share one embedding vector. This study aims to propose a polysemous embedding approach, named KG embedding under relational contexts(Cont E for short), for missing link prediction. Design/methodology/approach: Cont E models and infers different relationship patterns by considering the context of the relationship, which is implicit in the local neighborhood of the relationship. The forward and backward impacts of the relationship in Cont E are mapped to two different embedding vectors, which represent the contextual information of the relationship. Then, according to the position of the entity, the entity's polysemous representation is obtained by adding its static embedding vector to the corresponding context vector of the relationship. Findings: Cont E is a fully expressive, that is, given any ground truth over the triples, there are embedding assignments to entities and relations that can precisely separate the true triples from false ones. Cont E is capable of modeling four connectivity patterns such as symmetry, antisymmetry, inversion and composition. Research limitations: Cont E needs to do a grid search to find best parameters to get best performance in practice, which is a time-consuming task. Sometimes, it requires longer entity vectors to get better performance than some other models.Practical implications: Cont E is a bilinear model, which is a quite simple model that could be applied to large-scale KGs. By considering contexts of relations, Cont E can distinguish the exact meaning of an entity in different triples so that when performing compositional reasoning, it is capable to infer the connectivity patterns of relations and achieves good performance on link prediction tasks.Originality/value: Cont E considers the contexts of entities in terms of their positions in triples and the relationships they link to. It decomposes a relation vector into two vectors, namely, forward impact vector and backward impact vector in order to capture the relational contexts. Cont E has the same low computational complexity as Trans E. Therefore, it provides a new approach for contextualized knowledge graph embedding.