On the Effectiveness of Knowledge Graph Embeddings: a Rule Mining Approach

by   Johanna Jøsang, et al.
University of Bergen

We study the effectiveness of Knowledge Graph Embeddings (KGE) for knowledge graph (KG) completion with rule mining. More specifically, we mine rules from KGs before and after they have been completed by a KGE to compare possible differences in the rules extracted. We apply this method to classical KGEs approaches, in particular, TransE, DistMult and ComplEx. Our experiments indicate that there can be huge differences between the extracted rules, depending on the KGE approach for KG completion. In particular, after the TransE completion, several spurious rules were extracted.


page 8

page 10

page 22

page 24


Simple Rule Injection for ComplEx Embeddings

Recent works in neural knowledge graph inference attempt to combine logi...

On the Aggregation of Rules for Knowledge Graph Completion

Rule learning approaches for knowledge graph completion are efficient, i...

Ruleformer: Context-aware Differentiable Rule Mining over Knowledge Graph

Rule mining is an effective approach for reasoning over knowledge graph ...

Efficient Rule Learning with Template Saturation for Knowledge Graph Completion

The logic-based methods that learn first-order rules from knowledge grap...

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

For knowledge graph completion, two major types of prediction models exi...

Reinforced Anytime Bottom Up Rule Learning for Knowledge Graph Completion

Most of todays work on knowledge graph completion is concerned with sub-...

Revisiting Inferential Benchmarks for Knowledge Graph Completion

Knowledge Graph (KG) completion is the problem of extending an incomplet...

Please sign up or login with your details

Forgot password? Click here to reset