Abstract
Recent advances in information extraction have led to the so-called knowledge graphs (KGs), i.e., huge collections of relational factual knowledge. Since KGs are automatically constructed, they are inherently incomplete, thus naturally treated under the Open World Assumption (OWA). Rule mining techniques have been exploited to support the crucial task of KG completion. However, these techniques can mine Horn rules, which are insufficiently expressive to capture exceptions, and might thus make incorrect predictions on missing links. Recently, a rule-based method for filling in this gap was proposed which, however, applies to a flattened representation of a KG with only unary facts. In this work we make the first steps towards extending this approach to KGs in their original relational form, and provide preliminary evaluation results on real-world KGs, which demonstrate the effectiveness of our method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.: DBpedia: a nucleus for a web of open data. In: Aberer, K., et al. (eds.) ASWC/ISWC -2007. LNCS, vol. 4825, pp. 722–735. Springer, Heidelberg (2007). doi:10.1007/978-3-540-76298-0_52
Azevedo, P.J., Jorge, A.M.: Comparing rule measures for predictive association rules. In: ECML, pp. 510–517 (2007)
Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: SIGMOD, pp. 255–264 (1997)
Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Jr., E.R.H., Mitchell, T.M.: Toward an architecture for never-ending language learning. In: AAAI (2010)
Chen, Y., Goldberg, S., Wang, D.Z., Johri, S.S.: Ontological pathfinding: mining first-order knowledge from large knowledge bases. In: SIGMOD (2016)
Corapi, D., Russo, A., Lupu, E.: Inductive logic programming as abductive search. In: ICLP, pp. 54–63 (2010)
Darari, F., Nutt, W., Pirrò, G., Razniewski, S.: Completeness statements about RDF data sources and their use for query answering. In: Alani, H., et al. (eds.) ISWC 2013. LNCS, vol. 8218, pp. 66–83. Springer, Heidelberg (2013). doi:10.1007/978-3-642-41335-3_5
Dehaspe, L., Raedt, L.: Mining association rules in multiple relations. In: Lavrač, N., Džeroski, S. (eds.) ILP 1997. LNCS, vol. 1297, pp. 125–132. Springer, Heidelberg (1997). doi:10.1007/3540635149_40
Erxleben, F., Günther, M., Krötzsch, M., Mendez, J., Vrandečić, D.: Introducing wikidata to the linked data web. In: Mika, P., et al. (eds.) ISWC 2014. LNCS, vol. 8796, pp. 50–65. Springer, Cham (2014). doi:10.1007/978-3-319-11964-9_4
Flach, P.A., Kakas, A.: Abduction and Induction: Essays on Their Relation and Integration, vol. 18. Applied Logic Series (2000)
Gad-Elrab, M.H., Stepanova, D., Urbani, J., Weikum, G.: Exception-enriched rule learning from knowledge graphs. In: Groth, P., et al. (eds.) ISWC 2016. LNCS, vol. 9981, pp. 234–251. Springer, Cham (2016). doi:10.1007/978-3-319-46523-4_15
Galárraga, L., Teflioudi, C., Hose, K., Suchanek, F.M.: Fast rule mining in ontological knowledge bases with AMIE+. In: VLDB J. (2015)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP, pp. 1070–1080 (1988)
Helft, N.: Induction as nonmonotonic inference. In: KR, pp. 149–156 (1989)
Inoue, K., Kudoh, Y.: Learning extended logic programs. In: IJCAI, pp. 176–181 (1997)
Józefowska, J., Lawrynowicz, A., Lukaszewski, T.: The role of semantics in mining frequent patterns from knowledge bases in description logics with rules. TPLP 10(3), 251–289 (2010)
Lassila, O., Swick, R.R.: Resource description framework (RDF) model and syntax specification (1999)
Law, M., Russo, A., Broda, K.: Inductive learning of answer set programs. In: Fermé, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 311–325. Springer, Cham (2014). doi:10.1007/978-3-319-11558-0_22
Lehmann, J., Auer, S., Bühmann, L., Tramp, S.: Class expression learning for ontology engineering. J. Web Sem. 9(1), 71–81 (2011)
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The dlv system for knowledge representation and reasoning. ACM TOCL 7(3), 499–562 (2006)
Lisi, F.A.: Inductive logic programming in databases: from datalog to DL+log. TPLP 10(3), 331–359 (2010)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Berlin Heidelberg (1987)
Mahdisoltani, F., Biega, J., Suchanek, F.M.: YAGO3: A knowledge base from multilingual wikipedias. In: Proceedings of CIDR (2015)
Nickel, M., Murphy, K., Tresp, V., Gabrilovich, E.: A review of relational machine learning for knowledge graphs. Proc. IEEE 104(1), 11–33 (2016)
Ray, O.: Nonmonotonic abductive inductive learning. J. Appl. Log. 3(7), 329–340 (2008)
Sakama, C.: Induction from answer sets in nonmonotonic logic programs. ACM Trans. Comput. Log. 6(2), 203–231 (2005)
Taniar, D., Rahayu, W., Lee, V., Daly, O.: Exception rules in association rule mining. Appl. Math. Comput. 205(2), 735–750 (2008)
Quinlan, J.R.: Learning logical definitions from relations. Mach. Learn. 5, 239–266 (1990)
Wrobel, S.: First order theory refinement. In: ILP, pp. 14–33 (1996)
Acknowledgements
We thank anonymous reviewers for their insightful suggestions and Jacopo Urbani for his helpful comments on an earlier version of this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Tran, H.D., Stepanova, D., Gad-Elrab, M.H., Lisi, F.A., Weikum, G. (2017). Towards Nonmonotonic Relational Learning from Knowledge Graphs. In: Cussens, J., Russo, A. (eds) Inductive Logic Programming. ILP 2016. Lecture Notes in Computer Science(), vol 10326. Springer, Cham. https://doi.org/10.1007/978-3-319-63342-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-63342-8_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63341-1
Online ISBN: 978-3-319-63342-8
eBook Packages: Computer ScienceComputer Science (R0)