Knowledge Base Completion
64 papers with code • 0 benchmarks • 2 datasets
Knowledge base completion is the task which automatically infers missing facts by reasoning about the information already present in the knowledge base. A knowledge base is a collection of relational facts, often represented in the form of "subject", "relation", "object"-triples.
Benchmarks
These leaderboards are used to track progress in Knowledge Base Completion
Latest papers
BERTnesia: Investigating the capture and forgetting of knowledge in BERT
We found that ranking models forget the least and retain more knowledge in their final layer.
Explaining Neural Matrix Factorization with Gradient Rollback
Moreover, we show theoretically that the difference between gradient rollback's influence approximation and the true influence on a model's behavior is smaller than known bounds on the stability of stochastic gradient descent.
Lossless Compression of Structured Convolutional Models via Lifting
The computation graphs themselves then reflect the symmetries of the underlying data, similarly to the lifted graphical models.
BoxE: A Box Embedding Model for Knowledge Base Completion
Knowledge base completion (KBC) aims to automatically infer missing facts by exploiting information already present in a knowledge base (KB).
Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocols
Temporal knowledge bases associate relational (s, r, o) triples with a set of times (or a single time instant) when the relation is valid.
Knowledge Base Completion: Baseline strikes back (Again)
Most existing methods train with a small number of negative samples for each positive instance in these datasets to save computational costs.
Regex Queries over Incomplete Knowledge Bases
In response, we develop RotatE-Box -- a novel combination of RotatE and box embeddings.
Knowledge Base Completion for Constructing Problem-Oriented Medical Records
Both electronic health records and personal health records are typically organized by data type, with medical problems, medications, procedures, and laboratory results chronologically sorted in separate areas of the chart.
Tensor Decompositions for temporal knowledge base completion
Additionally, we propose a new dataset for knowledge base completion constructed from Wikidata, larger than previous benchmarks by an order of magnitude, as a new reference for evaluating temporal and non-temporal link prediction methods.
OxKBC: Outcome Explanation for Factorization Based Knowledge Base Completion
State-of-the-art models for Knowledge Base Completion (KBC) are based on tensor factorization (TF), e. g, DistMult, ComplEx.