RDF2Rules: Learning Rules from RDF Knowledge Bases by Mining Frequent Predicate Cycles

12/24/2015
by   Zhichun Wang, et al.
0

Recently, several large-scale RDF knowledge bases have been built and applied in many knowledge-based applications. To further increase the number of facts in RDF knowledge bases, logic rules can be used to predict new facts based on the existing ones. Therefore, how to automatically learn reliable rules from large-scale knowledge bases becomes increasingly important. In this paper, we propose a novel rule learning approach named RDF2Rules for RDF knowledge bases. RDF2Rules first mines frequent predicate cycles (FPCs), a kind of interesting frequent patterns in knowledge bases, and then generates rules from the mined FPCs. Because each FPC can produce multiple rules, and effective pruning strategy is used in the process of mining FPCs, RDF2Rules works very efficiently. Another advantage of RDF2Rules is that it uses the entity type information when generates and evaluates rules, which makes the learned rules more accurate. Experiments show that our approach outperforms the compared approach in terms of both efficiency and accuracy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/20/2019

Mining Rules Incrementally over Large Knowledge Bases

Multiple web-scale Knowledge Bases, e.g., Freebase, YAGO, NELL, have bee...
research
08/27/2019

Datalog Reasoning over Compressed RDF Knowledge Bases

Materialisation is often used in RDF systems to derive, in a preprocessi...
research
12/19/2017

Large-Scale Vandalism Detection with Linear Classifiers - The Conkerberry Vandalism Detector at WSDM Cup 2017

Nowadays many artificial intelligence systems rely on knowledge bases fo...
research
02/04/2021

Materializing Knowledge Bases via Trigger Graphs

The chase is a well-established family of algorithms used to materialize...
research
11/04/2019

REMI: Mining Intuitive Referring Expressions on Knowledge Bases

A referring expression (RE) is a description that identifies a set of in...
research
07/19/2012

SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases

The Internet has enabled the creation of a growing number of large-scale...
research
02/06/2013

Cost-Sharing in Bayesian Knowledge Bases

Bayesian knowledge bases (BKBs) are a generalization of Bayes networks a...

Please sign up or login with your details

Forgot password? Click here to reset