LRIRL: Improving Knowledge Graph Reasoning through Representation Learning-Based Rule Induction

Rule induction is an important approach for reasoning over Knowledge Graphs. Existing works mainly rely on searching for rule instances within the Knowledge Graph to induce rules. However, this approach may generate a vast search space, leading to inefficiency and difficulty in discovering rules that lack instance support. We propose a Logical Rule Induction based on Representation Learning (LRIRL) method, which can mine rules at the pattern level. By computing rule scores through vector representations of the rules, LRIRL can avoid the inefficiency caused by directly searching for rule instances in a vast search space. Furthermore, by incorporating the deductive nature of logical rules into the rule induction process, LRIRL can mine and evaluate rules even in the absence of rule instances. The generated rules can be used to perform more efficient and accurate reasoning tasks on the Knowledge Graph. Experimental results demonstrate that LRIRL outperforms baselines in both reasoning accuracy and rule mining efficiency on public datasets. Compared to the best baseline, LRIRL can achieve an average accuracy improvement of 3.43% in MRR, 1.40% in HITS@1, and 1.80% in HITS@10. Moreover, LRIRL can reduce rule mining time by an average of approximately 35% compared to the best baseline.