• Corpus ID: 239009845

LPRules: Rule Induction in Knowledge Graphs Using Linear Programming

@article{Dash2021LPRulesRI,
  title={LPRules: Rule Induction in Knowledge Graphs Using Linear Programming},
  author={Sanjeeb Dash and Jo{\~a}o Gonçalves},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.08245}
}
Knowledge graph (KG) completion is a well-studied problem in AI. Rule-based methods and embedding-based methods form two of the solution techniques. Rule-based methods learn first-order logic rules that capture existing facts in an input graph and then use these rules for reasoning about missing facts. A major drawback of such methods is the lack of scalability to large datasets. In this paper, we present a simple linear programming (LP) model to choose rules from a list of candidate rules and… 

References

SHOWING 1-10 OF 43 REFERENCES
Go for a Walk and Arrive at the Answer: Reasoning Over Paths in Knowledge Bases using Reinforcement Learning
TLDR
A new algorithm MINERVA is proposed, which addresses the much more difficult and practical task of answering questions where the relation is known, but only one entity, and significantly outperforms prior methods.
RNNLogic: Learning Logic Rules for Reasoning on Knowledge Graphs
TLDR
An EM-based algorithm for optimization of a probabilistic model called RNNLogic, which treats logic rules as a latent variable, and simultaneously trains a rule generator as well as a reasoning predictor with logic rules.
DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs
TLDR
DRUM is proposed, a scalable and differentiable approach for mining first-order logical rules from knowledge graphs that resolves the problem of learning probabilistic logical rules for inductive and interpretable link prediction.
Convolutional 2D Knowledge Graph Embeddings
TLDR
ConvE, a multi-layer convolutional network model for link prediction, is introduced and it is found that ConvE achieves state-of-the-art Mean Reciprocal Rank across most datasets.
M-Walk: Learning to Walk over Graphs using Monte Carlo Tree Search
TLDR
Experimental results on several graph-walking benchmarks show that M-Walk is able to learn better policies than other RL-based methods, which are mainly based on policy gradients.
Differentiable Learning of Logical Rules for Knowledge Base Reasoning
TLDR
A framework, Neural Logic Programming, is proposed that combines the parameter and structure learning of first-order logical rules in an end-to-end differentiable model and outperforms prior work on multiple knowledge base benchmark datasets, including Freebase and WikiMovies.
YAGO3: A Knowledge Base from Multilingual Wikipedias
TLDR
This work fuses the multilingual information with the English WordNet to build one coherent knowledge base that combines the information from the Wikipedias in multiple languages, and enlarges YAGO by 1m new entities and 7m new facts.
A Re-evaluation of Knowledge Graph Completion Methods
TLDR
This paper proposes a simple evaluation protocol that is robust to handle bias in the model, which can substantially affect the final results, and conducts extensive experiments and reports performance of several existing methods using the protocol.
Observed versus latent features for knowledge base and text inference
TLDR
It is shown that the observed features model is most effective at capturing the information present for entity pairs with textual relations, and a combination of the two combines the strengths of both model types.
The Detection of Patterns in Alyawarra Nonverbal Behavior
THE DETECTION OF PATTERNS IN ALYAWARRA NONVERBAL BEHAVIOR by Woodrow Wilson Denham Chairman of Supervisory Committee: Professor John R. Atkins Department of Anthropology Traditionally, cultural
...
1
2
3
4
5
...