1 code implementation • 16 Dec 2023 • Nicolas Hubert, Heiko Paulheim, Armelle Brun, Davy Monticolo
A common tacit assumption is the KGE entity similarity assumption, which states that these KGEMs retain the graph's structure within their embedding space, \textit{i. e.}, position similar entities within the graph close to one another.
no code implementations • 8 Dec 2023 • Nicolas Hubert, Pierre Monnin, Heiko Paulheim
Consequently, a larger body of works focuses on the completion of missing information in KGs, which is commonly referred to as link prediction (LP).
1 code implementation • 7 Sep 2023 • Nicolas Hubert, Pierre Monnin, Mathieu d'Aquin, Davy Monticolo, Armelle Brun
In some data-sensitive fields such as education or medicine, access to public datasets is even more limited.
1 code implementation • 6 Jun 2023 • Nicolas Hubert, Heiko Paulheim, Pierre Monnin, Armelle Brun, Davy Monticolo
These models learn a vector representation of knowledge graph entities and relations, a. k. a.
2 code implementations • 1 Mar 2023 • Nicolas Hubert, Pierre Monnin, Armelle Brun, Davy Monticolo
In an extensive and controlled experimental setting, we show that the proposed loss functions systematically provide satisfying results which demonstrates both the generality and superiority of our proposed approach.
2 code implementations • 13 Jan 2023 • Nicolas Hubert, Pierre Monnin, Armelle Brun, Davy Monticolo
That is why, in this paper, we extend our previously introduced metric Sem@K that measures the capability of models to predict valid entities w. r. t.