Knowledge Base Completion With Analogical Inference on Context Graphs

Nada Mimouni 1 Jean-Claude Moissinac 2 Anh Vu
1 RCLN
LIPN - Laboratoire d'Informatique de Paris-Nord
Abstract : Knowledge base completion refers to the task of adding new, missing, links between entities. In this work we are interested in the problem of knowledge Graph (KG) incompleteness in general purpose knowledge bases like DBpedia and Wikidata. We propose an approach for discovering implicit triples using observed ones in the incomplete graph leveraging analogy structures deducted from a KG embedding model. We use a language modelling approach where semantic regularities between words are preserved which we adapt to entities and relations. We consider excerpts from large input graphs as a reduced and meaningful context for a set of entities of a given domain. The first results show that analogical inferences in the projected vector space is relevant to a link prediction task.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.telecom-paristech.fr/hal-02281147
Contributor : Jean-Claude Moissinac <>
Submitted on : Sunday, September 8, 2019 - 3:10:30 PM
Last modification on : Wednesday, September 11, 2019 - 1:15:04 AM

File

SemaPro_2019_Analogy_inference...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02281147, version 1

Collections

Citation

Nada Mimouni, Jean-Claude Moissinac, Anh Vu. Knowledge Base Completion With Analogical Inference on Context Graphs. Semapro 2019, Sep 2019, Porto, France. ⟨hal-02281147⟩

Share

Metrics

Record views

55

Files downloads

45