Exception-enrcihed Rule Learning from Knowledge Graphs
1. Exception-enriched Rule
Learning from Knowledge
Graphs
Mohamed Gad-Elrab1, Daria Stepanova1, Jacopo Urbani 2, Gerhard Weikum1
1Max-Planck-Institut fΓΌr Informatik, Saarland Informatics Campus, Germany
2 Vrije Universiteit Amsterdam, Amsterdam, The Netherlands
21st October 2016
2. Knowledge Graphs (KGs)
2
β’ Huge collection of < π π’πππππ‘, ππππππππ‘π, ππππππ‘ > triples
β’ Positive facts under Open World Assumption (OWA)
β’ Possibly incomplete and/or inaccurate
3. Mining Rules from KGs
3
Amsterdam
isMarriedToJohn Kate
Chicago
isMarriedToBrad Anna
Berlin
hasBrother
isMarriedToDave ClaraisMarriedToBob Alice
Researcher
Berlin Football
4. Mining Rules from KGs
4
π: πππ£ππ πΌπ π, π β ππ πππππππππ π, π , πππ£ππ πΌπ(π, π)
Amsterdam
isMarriedToJohn Kate
Chicago
isMarriedToBrad Anna
Berlin
hasBrother
isMarriedToDave ClaraisMarriedToBob Alice
Researcher
Berlin Football
[GalΓ‘rraga et al., 2015]
5. Mining Rules from KGs
5
π: πππ£ππ πΌπ π, π β ππ πππππππππ π, π , πππ£ππ πΌπ(π, π)
Amsterdam
isMarriedToJohn Kate
Chicago
isMarriedToBrad Anna
Berlin
hasBrother
isMarriedToDave ClaraisMarriedToBob Alice
Researcher
Berlin Football
1 2
6. Our Goal
6
π: πππ£ππ πΌπ π, π β ππ πππππππππ π, π , πππ£ππ πΌπ π, π , πππ‘ ππ π΄(π, πππ )
Amsterdam
isMarriedToJohn Kate
Chicago
isMarriedToBrad Anna
Berlin
hasBrother
isMarriedToDave ClaraisMarriedToBob Alice
Researcher
Berlin Football
1 2
7. Problem Statement
β’ Quality-based theory revision problem
β’ Given
β’ Knowledge graph πΎπΊ
β’ Set of Horn rules π π»
β’ Find the nonmonotonic revision π ππ of π π»
β’ Maximize top-k avg. confidence
β’ Minimize conflicting prediction
7
8. Problem Statement
β’ Quality-based theory revision problem
β’ Given
β’ Knowledge graph πΎπΊ
β’ Set of Horn rules π π»
β’ Find the nonmonotonic revision π ππ of π π»
β’ Maximize top-k avg. confidence
β’ Minimize conflicting prediction
8
Unknown
16. Step 4: Selecting the Best Revision
Finding globally best revision is expensive!
β’ NaΓ―ve ranker
β’ For each rule, pick the revision that maximizes confidence
β’ Works in isolation from other rules
β’ Partial materialization ranker
β’ πΎπΊs are incomplete!
β’ Augment the original πΎπΊ with predictions of other rules
β’ Rank revisions on avg. confidence of the rule and its auxiliary.
16
23. Summary
β’ Conclusion
β’ Quality-based theory revision under OWA
β’ Partial materialization for ranking revisions
β’ Comparison of ranking methods on real life KGs
β’ Outlook
β’ Extending to higher arity predicates
β’ Binary predicates [Tran et al., to appear ILP2016]
β’ Evidence from text corpora
β’ Exploiting partial completeness
23
24. References
β’ [Angiulli and Fassetti, 2014] Fabrizio Angiulli and Fabio Fassetti. Exploiting domain knowledge to
detect outliers. Data Min. Knowl. Discov., 28(2):519β568, 2014.
β’ [Dimopoulos and Kakas, 1995] Yannis Dimopoulos and Antonis C. Kakas. Learning non-monotonic
logic programs: Learning exceptions. In Machine Learning: ECML-95, 8th European Conference on
Machine Learning, Heraclion, Crete, Greece, April 25-27, 1995, Proceedings, pages 122β137, 1995.
β’ [Galarraga et al., 2015] Luis Galarraga, Christina Teflioudi, Katja Hose, and Fabian M. Suchanek.
Fast Rule Mining in Ontological Knowledge Bases with AMIE+. In VLDB Journal, 2015.
β’ [Law et al., 2015] Mark Law, Alessandra Russo, and Krysia Broda. The ILASP system for learning
answer set programs, 2015.
β’ [Leone et al., 2006] Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob,
Simona Perri, and Francesco Scarcello. 2006. The DLV system for knowledge representation and
reasoning. ACM Trans. Comput. Logic 7, 3 (July 2006), 499-562.
β’ [Suzuki, 2006] Einoshin Suzuki. Data mining methods for discovering interesting exceptions from
an unsupervised table. J. UCS, 12(6):627β653, 2006.
β’ [Tran et al., 2016] Hai Dang Tran, Daria Stepanova, Mohamed H. Gad-Elrab, Francesca A. Lisi,
Gerhard Weikum. Towards Nonmonotonic Relational Learning from Knowledge Graphs. ILP2016,
London, UK, to appear.
β’ [Katzouris et al., 2015] Nikos Katzouris, Alexander Artikis, and Georgios Paliouras. Incremental
learning of event definitions with inductive logic programming. Machine Learning, 100(2-3):555β
585, 2015.
24
25. Related Work
β’ Learning nonmonotonic programs
β’ E.g., [Dimopoulos and Kakas, 1995], ILASP [Law et al., 2015],
ILED [Katzouris et al., 2015], etc.
β’ Outlier detection in logic programs
β’ E.g., [Angiulli and Fassetti, 2014], etc.
β’ Mining exception rules
β’ E.g., [Suzuki, 2006], etc.
25
30. Experiments
β’ Predictions assessment
β’ Run DLV on YAGO and π π» then π ππ seperately
β’ Sample facts such that fact π β ππ΄πΊπ π»ππ΄πΊπ ππ
β’ 73% of the sampled facts were found to be erroneous
30
checked
predictions
31. Ranking Ruleβs Revisions
β’ Partial materialization ranker
β’ Augment the original πΎπΊ with predictions of other rules
β’ Rank revisions on Avg. confidence of the π and π ππ’π₯
31
π ππππ ππ, πΎπΊβ =
ππππ ππ, πΎπΊβ + ππππ(ππ
ππ’π₯, πΎπΊβ)
2
where ππ is the rule π with exception π & πΎπΊβ
is the augmented πΎπΊ.