SOTAVerified

Fast Linear Model for Knowledge Graph Embeddings

2017-10-30Code Available0· sign in to hype

Armand Joulin, Edouard Grave, Piotr Bojanowski, Maximilian Nickel, Tomas Mikolov

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

This paper shows that a simple baseline based on a Bag-of-Words (BoW) representation learns surprisingly good knowledge graph embeddings. By casting knowledge base completion and question answering as supervised classification problems, we observe that modeling co-occurences of entities and relations leads to state-of-the-art performance with a training time of a few minutes using the open sourced library fastText.

Tasks

Reproductions