Fast and Exact Rule Mining with AMIE 3

Given a knowledge base (KB), rule mining finds rules such as “If two people are married, then they live (most likely) in the same place”. Due to the exponential search space, rule mining approaches still have difficulties to scale to today’s large KBs. In this paper, we present AMIE 3, a system that employs a number of sophisticated pruning strategies and optimizations. This allows the system to mine rules on large KBs in a matter of minutes. Most importantly, we do not have to resort to approximations or sampling, but are able to compute the exact confidence and support of each rule. Our experiments on DBpedia, YAGO, and Wikidata show that AMIE 3 beats the state of the art by a factor of more than 15 in terms of runtime.

[1]  Daisy Zhe Wang,et al.  Ontological Pathfinding , 2016, SIGMOD Conference.

[2]  Stephen Muggleton,et al.  Learning from Positive Data , 1996, Inductive Logic Programming Workshop.

[3]  Fabian M. Suchanek,et al.  Canonicalizing Open Knowledge Bases , 2014, CIKM.

[4]  Bart Goethals,et al.  Relational Association Rules: Getting WARMeR , 2002, Pattern Detection and Discovery.

[5]  Axel Polleres,et al.  Binary RDF representation for publication and exchange (HDT) , 2013, J. Web Semant..

[6]  Jignesh M. Patel,et al.  QuickFOIL: Scalable Inductive Logic Programming , 2014, Proc. VLDB Endow..

[7]  Gerhard Weikum,et al.  Knowledge Representation and Rule Mining in Entity-Centric Knowledge Bases , 2019, Reasoning Web.

[8]  Paolo Papotti,et al.  Explainable Fact Checking with Probabilistic Answer Set Programming , 2019, TTO.

[9]  Ryutaro Ichise,et al.  Graph Pattern Entity Ranking Model for Knowledge Graph Completion , 2019, NAACL.

[10]  Fabian M. Suchanek,et al.  Fast rule mining in ontological knowledge bases with AMIE+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$+$$\end{docu , 2015, The VLDB Journal.

[11]  David J. Hand,et al.  Pattern Detection and Discovery , 2002, Pattern Detection and Discovery.

[12]  Christopher Ré,et al.  Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS , 2011, Proc. VLDB Endow..

[13]  Paolo Papotti,et al.  Mining Expressive Rules in Knowledge Graphs , 2020, ACM J. Data Inf. Qual..

[14]  Paolo Papotti,et al.  Robust Discovery of Positive and Negative Rules in Knowledge Bases , 2018, 2018 IEEE 34th International Conference on Data Engineering (ICDE).

[15]  Fabian M. Suchanek,et al.  AMIE: association rule mining under incomplete evidence in ontological knowledge bases , 2013, WWW.

[16]  Daisy Zhe Wang,et al.  ScaLeKB: scalable learning and inference over large knowledge bases , 2016, The VLDB Journal.

[17]  Serge Abiteboul,et al.  PARIS: Probabilistic Alignment of Relations, Instances, and Schema , 2011, Proc. VLDB Endow..

[18]  J. Ross Quinlan,et al.  Learning logical definitions from relations , 1990, Machine Learning.

[19]  Reynold Cheng,et al.  Discovering Meta-Paths in Large Heterogeneous Information Networks , 2015, WWW.

[20]  Nicoleta Preda,et al.  Mining rules to align knowledge bases , 2013, AKBC '13.