<abstract xmlns="http://www.w3.org/1999/xhtml">

<sec><h3>Purpose</h3>
<p>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 (ContE for short), for missing link prediction.</p>
</sec>
<sec><h3>Design/methodology/approach</h3>
<p>ContE 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 ContE 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.</p>
</sec>
<sec><h3>Findings</h3>
<p>ContE 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. ContE is capable of modeling four connectivity patterns such as symmetry, antisymmetry, inversion and composition.</p>
</sec>
<sec><h3>Research limitations</h3>
<p>ContE 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.</p>
</sec>
<sec><h3>Practical implications</h3>
<p>ContE is a bilinear model, which is a quite simple model that could be applied to large-scale KGs. By considering contexts of relations, ContE 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.</p>
</sec>
<sec><h3>Originality/value</h3>
<p>ContE 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. ContE has the same low computational complexity as TransE. Therefore, it provides a new approach for contextualized knowledge graph embedding.</p>
</sec>
</abstract>

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 (ContE for short), for missing link prediction.

Design/methodology/approach
ContE 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 ContE 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
ContE 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. ContE is capable of modeling four connectivity patterns such as symmetry, antisymmetry, inversion and composition.

Research limitations
ContE 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
ContE is a bilinear model, which is a quite simple model that could be applied to large-scale KGs. By considering contexts of relations, ContE 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
ContE 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. ContE has the same low computational complexity as TransE. Therefore, it provides a new approach for contextualized knowledge graph embedding.

Learning Context-based Embeddings for Knowledge Graph Completion

School of Computer and Information Engineering

Journal of Data and Information Science

This work is licensed under the Creative Commons Attribution 4.0 International License.

{"article-title":"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...

Learning Context-based Embeddings for Knowledge Graph Completion

Article Category: Research Paper

Publicado en línea: 25 abr 2022

Páginas: 84 - 106

Recibido: 03 nov 2021

Aceptado: 10 mar 2022

DOI: https://doi.org/10.2478/jdis-2022-0009

Palabras clave
Full expressiveness, Relational contexts, Knowledge graph embedding, Relation patterns, Link prediction

© 2022 Fei Pu et al., published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Learning Context-based Embeddings for Knowledge Graph Completion

Article Category: Research Paper

Publicado en línea: 25 abr 2022

Páginas: 84 - 106

Recibido: 03 nov 2021

Aceptado: 10 mar 2022

DOI: https://doi.org/10.2478/jdis-2022-0009

Palabras claveFull expressiveness, Relational contexts, Knowledge graph embedding, Relation patterns, Link prediction

© 2022 Fei Pu et al., published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Palabras clave
Full expressiveness, Relational contexts, Knowledge graph embedding, Relation patterns, Link prediction