Scalable knowledge base completion with superposition memories

10/24/2021
by   Matthias Lalisse, et al.
8

We present Harmonic Memory Networks (HMem), a neural architecture for knowledge base completion that models entities as weighted sums of pairwise bindings between an entity's neighbors and corresponding relations. Since entities are modeled as aggregated neighborhoods, representations of unseen entities can be generated on the fly. We demonstrate this with two new datasets: WNGen and FBGen. Experiments show that the model is SOTA on benchmarks, and flexible enough to evolve without retraining as the knowledge graph grows.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/23/2017

An overview of embedding models of entities and relationships for knowledge base completion

Knowledge bases of real-world facts about entities and their relationshi...
research
06/18/2017

Knowledge Transfer for Out-of-Knowledge-Base Entities: A Graph Neural Network Approach

Knowledge base completion (KBC) aims to predict missing information in a...
research
04/20/2016

A Factorization Machine Framework for Testing Bigram Embeddings in Knowledgebase Completion

Embedding-based Knowledge Base Completion models have so far mostly comb...
research
04/30/2018

Demand-Weighted Completeness Prediction for a Knowledge Base

In this paper we introduce the notion of Demand-Weighted Completeness, a...
research
11/03/2022

Embedding Knowledge Graph of Patent Metadata to Measure Knowledge Proximity

Knowledge proximity refers to the strength of association between any tw...
research
08/16/2019

Distributional Negative Sampling for Knowledge Base Completion

State-of-the-art approaches for Knowledge Base Completion (KBC) exploit ...
research
06/02/2023

Predicting affinity ties in a surname network

From administrative registers of last names in Santiago, Chile, we creat...

Please sign up or login with your details

Forgot password? Click here to reset