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. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kuželka, O., & Železný, F. (2011). Seeing the world through homomorphism: An experimental study on reducibility of examples. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6489 LNAI, pp. 138–145). https://doi.org/10.1007/978-3-642-21295-6_17
Mendeley helps you to discover research relevant for your work.