International Conference on Inductive Logic Programming

ILP 2010: Inductive Logic Programming pp 138-145

Seeing the World through Homomorphism: An Experimental Study on Reducibility of Examples

  • Ondřej Kuželka
  • Filip Železný
Conference paper

DOI: 10.1007/978-3-642-21295-6_17

Volume 6489 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Kuželka O., Železný F. (2011) Seeing the World through Homomorphism: An Experimental Study on Reducibility of Examples. In: Frasconi P., Lisi F.A. (eds) Inductive Logic Programming. ILP 2010. Lecture Notes in Computer Science, vol 6489. Springer, Berlin, Heidelberg

Abstract

We study reducibility of examples in several typical inductive logic programming benchmarks. The notion of reducibility that we use is related to theta-reduction, commonly used to reduce hypotheses in ILP. Whereas examples are usually not reducible on their own, they often become implicitly reducible when language for constructing hypotheses is fixed. We show that number of ground facts in a dataset can be almost halved for some real-world molecular datasets. Furthermore, we study the impact this has on a popular ILP system Aleph.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ondřej Kuželka
    • 1
  • Filip Železný
    • 1
  1. 1.Intelligent Data Analysis Research Group, Dept. of CyberneticsCzech Technical University in PragueCzech Republic