A Probabilistic Framework for Knowledge Graph Data Augmentation

10/25/2021
by   Jatin Chauhan, et al.
11

We present NNMFAug, a probabilistic framework to perform data augmentation for the task of knowledge graph completion to counter the problem of data scarcity, which can enhance the learning process of neural link predictors. Our method can generate potentially diverse triples with the advantage of being efficient and scalable as well as agnostic to the choice of the link prediction model and dataset used. Experiments and analysis done on popular models and benchmarks show that NNMFAug can bring notable improvements over the baselines.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/19/2019

An Open-World Extension to Knowledge Graph Completion Models

We present a novel extension to embedding-based knowledge graph completi...
research
09/16/2020

CoDEx: A Comprehensive Knowledge Graph Completion Benchmark

We present CoDEx, a set of knowledge graph completion datasets extracted...
research
07/01/2019

Augmenting and Tuning Knowledge Graph Embeddings

Knowledge graph embeddings rank among the most successful methods for li...
research
03/26/2022

Augmenting Knowledge Graphs for Better Link Prediction

Embedding methods have demonstrated robust performance on the task of li...
research
01/06/2023

IMKGA-SM: Interpretable Multimodal Knowledge Graph Answer Prediction via Sequence Modeling

Multimodal knowledge graph link prediction aims to improve the accuracy ...
research
11/01/2021

Transductive Data Augmentation with Relational Path Rule Mining for Knowledge Graph Embedding

For knowledge graph completion, two major types of prediction models exi...
research
05/25/2023

How to Turn Your Knowledge Graph Embeddings into Generative Models via Probabilistic Circuits

Some of the most successful knowledge graph embedding (KGE) models for l...

Please sign up or login with your details

Forgot password? Click here to reset