Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1512.07734 v1 pith:M43E4SEF submitted 2015-12-24 cs.AI cs.DB

classification cs.AIcs.DB
keywords rulesbasesknowledgerdf2rulesapproachfpcsfrequentcycles
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Large Language Model-Enhanced Symbolic Reasoning for Knowledge Base Completion

    cs.CL 2025-01 conditional novelty 5.0 of 10

    LeSR uses an LLM to propose logic rules from sampled subgraphs, then a trainable reasoner weights those rules against the knowledge base and combines them with RotatE for KBC.

Pith tools