Abstract
In many applications of Inductive Logic Programming (ILP), learning occurs from a knowledge base that contains a large number of examples. Storing such a knowledge base may consume a lot of memory. Often, there is a substantial overlap of information between different examples. To reduce memory consumption, we propose a method to represent a knowledge base more compactly. We achieve this by introducing a meta-theory able to build new theories out of other (smaller) theories. In this way, the information associated with an example can be built from the information associated with one or more other examples and redundant storage of shared information is avoided. We also discuss algorithms to construct the information associated with example theories and report on a number of experiments evaluating our method in different problem domains.
Article PDF
Similar content being viewed by others
References
Arni, F., Ong, K. Tsur, S. Wang, H., & Zaniolo, C. (2003). The deductive database system LDL++. Theory andPractice of Logic Programming, 3:1, 61–94.
Barklund, J. (1995). Metaprogramming in logic. Encyclopedia of Computer Science and Technology, 33, 205–227.
Blockeel, H., & De Raedt, L. (1996). Relational knowledge discovery in databases. In Proceedings of the Sixth International Workshop on Inductive Logic Programming, Vol. 1314 of Lecture Notes in Artificial Intelligence (pp. 199-212) Springer-Verlag.
Blockeel, H., & De Raedt, L. (1998). Top-down induction of first order logical decision trees. Artificial Intelligence 101:1-2, 285–297.
Blockeel, H., De Raedt, L., Jacobs, N., & Demoen, B., (1999). Scaling up inductive logic programming by learning from interpretations. Data Mining and Knowledge Discovery 3:1, 59–93.
Blockeel, H., Dehaspe, L., Demoen, B., Janssens, G., Ramon, J., & Vandecasteele, H. (2002). Improving the efficiency of inductive logic programming through the use of query packs. Journal of Artificial Intelligence Research 16, 135–166.
Cussens, J. (1997). Part-of-speech tagging using Progol. In Proceedings of the Seventh International Workshop on Inductive Logic Programming (pp. 93–108). Springer-Verlag.
Das, S. K. (1992). Deductive databases and logic programming. Addison-Wesley.
De Raedt, L., & D?zeroski, S. (1994). First order jk-clausal theories are PAC-learnable. Artificial Intelligence, 70, 375–392.
Dehaspe, L., & Toivonen, H. (1999). Discovery of frequent Datalog patterns. Data Mining and Knowledge Discovery 3:1, 7–36. DTP, The Developmental Therapeutics Program. U.S. Departement of Health and Human Services NIH, National Cancer Institute NCI. http://dtp.nci.nih.gov.
D?zeroski, S., De Raedt, L., & Driessens, K. (2001). Relational reinforcement learning. Machine Learning 43, 7–52.
Gallo, G., Longo, G., Pallottino, S., & Nguyen, S. (1993). Directed hypergraphs and applications. Discrete Applied Mathematics 42, 177–201.
Goodrich, M. T., & Tamassia, R. (2002). Algorithm design. Wiley.
Hill, P. M., & Gallagher, J. (1998). Meta-programming in logic progamming. Handbook of Logic in Artificial Intelligence and Logic Programming, 5, 421–498.
Ito, M., & Ohwada, H. (2001). Efficient database access for implementing a scalable ILP engine. In Work-In-Progress Report of the Eleventh International Conference on Inductive Logic Programming.
Jacobs, N., & Blockeel, H. (2001). From shell logs to shell scripts. In Proceedings of ILP2001-Eleventh International Workshop on Inductive Logic Programming, Vol. 2157 of Lecture Notes in Artificial Intelligence (pp. 80–90).
Kim, J., & Soo-hyun, J. (1997). Learn to play Go-A master's guide to the ultimate game. Good Move Press.
Mehta, M., Agrawal, R., & Rissanen, J. (1996). SLIQ: A fast scalable classifier for data mining. In Proceedings of the Fifth International Conference on Extending Database Technology, Vol. 1057 of Lecture Notes in Computer Science. Springer-Verlag.
Morik, K., & Brockhausen, P. (1997). A multistrategy approach to relational discovery in databases. Machine Learning, 27:3, 287–312.
Muggleton, S., (1995). Inverse entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming 13:3/4, 245–286.
Muggleton, S., King, R., & Sternberg, M. (1992). Protein secondary structure prediction using logic-based machine learning. Protein Engineering 7, 647–657.
Paschos, V. (1997). A survey of approximately optimal solutions to some covering and packing problems. ACM Computing Surveys 29:2, 171–209.
Ramon, J., Francis, T., & Blockeel, H. (2000). Learning a Tsume-Go heuristic with Tilde. In Proceedings of CG2000, the Second International Conference on Computers and Games, Vol. 2063 of Lecture Notes in Computer Science (pp. 151–169). Springer-Verlag.
Rouveirol, C. (1994). Flattening and saturation: two representation changes for generalization. Machine Learning, 14, 219–232.
Struyf, J., Ramon, J. Verbaeten, S. Bruynooghe, M., & Blockeel, H. (2004). Compact representation of knowledge bases in inductive logic programming. Technical ReportCW377, Department of Computer Science, Katholieke Universiteit Leuven.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Struyf, J., Ramon, J., Bruynooghe, M. et al. Compact Representation of Knowledge Bases in Inductive Logic Programming. Machine Learning 57, 305–333 (2004). https://doi.org/10.1023/B:MACH.0000039780.84966.04
Issue Date:
DOI: https://doi.org/10.1023/B:MACH.0000039780.84966.04