Abstract
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the problem expressed in a FOL framework into a attribute-value problem and then applying efficient algebraic learning techniques. The complexity of such propositionalization methods is now in the size of the reformulated problem which can be exponential. We propose a method that selectively propositionalizes the FOL training set by interleaving boolean reformulation and algebraic resolution. It avoids, as much as possible, the generation of redundant boolean examples, and still ensures that explicit correct and complete definitions are learned.
This work has been partially supported by ESPRIT through LTR ILP 2 n. 20237.
Chapter PDF
References
De Raedt, L.: Attribute-value learning versus inductive logic programming: The missing link. In: Page, D. (ed.) Proc. of the 8th International Workshop on ILP, pp. 1–8. Springer, Heidelberg (1998)
Dietterich, T., Lathrop, R., Lozano-Perez, T.: Solving the multi-instance problem with axis-parallel rectangles. Artificial Intelligence 89, 31–71 (1996)
Fayyad, U.: Knowledge discovery in databases: An overview. In: Lavrač, N., Džeroski, S. (eds.) Proc. of the 7th International Workshop on ILP, pp. 1–16. Springer, Heidelberg (1997)
Ganascia, J.-G.: A rule system learning system. In: Bajcsy, R. (ed.) Proc. Of International Joint Conference of Artificial Intelligence, pp. 432–438. Morgan Kaufmann, San Francisco (1993)
Kramer, S., Pfahringer, B., Helma, C.: Stochastic propositionalization of nondeterminate background knowledge. In: Page, D. (ed.) Proc. of the 8th International Workshop on ILP, pp. 80–94. Springer, Heidelberg (1998)
Lavrač, N., Džeroski, S.: Inductive Logic Programming: techniques and Applications. Ellis Horwood (1994)
Mitchell, T.M.: Generalization as search. Artificial Intelligence 18, 203–226 (1982)
Muggleton, S., Feng, C.: Efficient induction in logic programs. In: Muggleton, S. (ed.) International Workshop on ILP, pp. 281–298. Academic Press, London (1992)
Plotkin, G.: A note on inductive generalization. In: Plotkin, G. (ed.) Machine Intelligence, vol. 5, Edinburgh University Press (1970)
Quinlan, J.R.: C4. 5: Programs for Machine Learning, MK, San Mateo, CA (1993)
Sebag, M.: Resource bounded induction and deduction in FOL. In: Proc. on Multi Strategy Learning (1998)
Quinlan, J.R.: C4. 5: Programs for Machine Learning, MK, San Mateo, CA (1993)
Sebag, M., Rouveirol, C.: Tractable induction and classification in first order logic via stochastic matching. In: 15th Int. Join Conf. on Artificial Intelligence (IJCAI 1997), Nagoya, Japan, pp. 888–893. Morgan Kaufmann, San Francisco (1997)
Wrobel, S.: An algorithm for multi-relational discovery of subgroups. In: Proc. Of PKDD, pp. 78–87. Springer, Heidelberg (1997)
Zucker, J.-D., Ganascia, J.-G.: Learning strcutural indeterminate clauses. In: Page, D. (ed.) Proc. of the 8th International Workshop on ILP, pp. 235–244. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alphonse, É., Rouveirol, C. (1999). Selective Propositionalization for Relational Learning. In: Żytkow, J.M., Rauch, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 1999. Lecture Notes in Computer Science(), vol 1704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48247-5_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-48247-5_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66490-1
Online ISBN: 978-3-540-48247-5
eBook Packages: Springer Book Archive