Entity Embedding Analogy for Implicit Link Discovery

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work we are interested in the problem of knowledge graph (KG) incompleteness, which we propose to solve by 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 that we adapt to entities and relations. The first results show that analogical inferences in the projected vector space is relevant to a link prediction task.

Cite

CITATION STYLE

APA

Mimouni, N., Moissinac, J. C., & Vu, A. T. (2019). Entity Embedding Analogy for Implicit Link Discovery. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11762 LNCS, pp. 126–129). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-32327-1_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free