9:20 AM - 9:40 AM
[4F1-GS-3-02] Knowledge graph embedding model for unknown facts
Keywords:knowledge graph embedding, link prediction
Knowledge graph completion is a task that aims to predict missing triples by computing embeddings for entities and relations observed during learning.
In the real-world task, new entities and relations are dynamically added to knowledge graphs. However, most knowledge graph completion methods cannot infer missing triples for the added entities and relations if they are less or non-existent in the knowledge graph.
In this research, we constructed a model that can be trained on a small sample of data and can make embeddings for new entities and relations, which can also perform knowledge graph completion. Experimental results showed that the performance of the model was not as good as the existing knowledge completion model, but the modeling of multi-hop relations might lead to improved results.
In the real-world task, new entities and relations are dynamically added to knowledge graphs. However, most knowledge graph completion methods cannot infer missing triples for the added entities and relations if they are less or non-existent in the knowledge graph.
In this research, we constructed a model that can be trained on a small sample of data and can make embeddings for new entities and relations, which can also perform knowledge graph completion. Experimental results showed that the performance of the model was not as good as the existing knowledge completion model, but the modeling of multi-hop relations might lead to improved results.
Authentication for paper PDF access
A password is required to view paper PDFs. If you are a registered participant, please log on the site from Participant Log In.
You could view the PDF with entering the PDF viewing password bellow.