A Factorization Machine Framework for Testing Bigram Embeddings in Knowledgebase Completion

Understand

Embedding-based Knowledge Base Completion models have so far mostly combined distributed representations of individual entities or relations to compute truth scores of missing links.

• Facts can however also be represented using pairwise embeddings, i.e.
• embeddings for pairs of entities and relations.
• In this paper we explore such bigram embeddings with a flexible Factorization Machine model and several ablations from it.