Abstract
We describe the propositional learning system CiPF, which tightly couples a simple concept learner with a sophisticated constructive induction component. It is described in terms of a generic architecture for constructive induction. We focus on the problem of controlling the abundance of opportunities for constructively adding new attributes. In CiPF the so-called Minimum Description Length (MDL) principle acts as a powerful control heuristic. This is also confirmed in the experiments reported.
Chapter PDF
References
Aha, D.W.: Generalizing from Case Studies: A Case Study, in Sleeman, D. and Edwards, P.(eds.), Machine Learning: Proceedings of the Ninth International Workshop (ML92), Morgan Kaufmann, San Mateo, CA, pp. 1–10, 1992.
Angluin, D., Laird, P.: Learning from Noisy Examples, Machine Learning, 2(4), 343–370, 1987.
Bloedorn E., Wnek J., Michalski R.S.: Multistrategy Constructive Induction: AQ17-MCI, in Michalski R.S. and Tecuci G.(eds.), Proceedings of the Second International Workshop on Multistrategy Learning (MSL-93), Harpers Ferry, W.VA., pp.188–206, 1993.
Cameron-Jones, R.M., Quinlan, J.R.: Avoiding Pitfalls When Learning Recursive Theories, in Bajcsy, R.(ed.), Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, Morgan Kaufmann, San Mateo, CA, pp. 1050–1057, 1993.
Dietterich, T.G., Michalski, R.S.: Inductive Learning of Structural Descriptions: Evaluation Criteria and Comparative Review of Selected Methods, Artificial Intelligence, 16(3), 257–294, 1981.
Dolsak, B., Muggleton, S.: The Application of Inductive Logic Programming to Finite-Element Mesh Design, in Muggleton, S., Inductive Logic Programming, Academic Press, London, U.K., 1992.
Dzeroski, S., Lavrac, N.: Learning Relations from Noisy Examples: An Empirical Comparison of LINUS and FOIL, in Birnbaum, L.A. and Collins, G.C.(eds.), Machine Learning: Proceedings of the Eighth International Workshop (ML91), Morgan Kaufmann, San Mateo, CA, pp. 399–402, 1991.
Dzeroski S., Bratko I.: Handling Noise in Inductive Logic Programming, Proceedings of the 2nd International Workshop on Inductive Logic Programming, 1992.
Fuernkranz J.: A numerical analysis of the KRK domain. Working Note, 1993. Available upon request.
Holte R.C.: Very Simple Classification Rules Perform Well on Most Commonly Used Datasets, Machine Learning, 11(1), 1993.
Kerber, R.: ChiMerge: Discretization of Numeric Attributes, in Proceedings of the Tenth National Conference on Artificial Intelligence, AAAI Press/MIT Press, Menlo Park, pp. 123–128, 1992.
Kramer S.: CN2-MCI: Ein zweistufiges Verfahren für konstruktive Induktion, Master's thesis in preparation, Vienna, 1993.
Lavrac N., Cestnik B., Dzeroski S.: Search heuristics in empirical Inductive Logic Programming, in Workshop W18, Logical Approaches to Machine Learning, ECAI-92, Vienna, 1992
Matheus, C.J., Rendell, L.A.: Constructive Induction On Decision Trees, in Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89), Morgan Kaufmann, Los Altos, CA, 645–650, 1989.
Matheus, C.J.: Adding Domain Knowledge to SBL Through Feature Construction, in Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90), AAAI Press/MIT Press, Menlo Park, CA, pp. 803–808, 1990.
Mehra, P., Rendell, L.A., Wah, B.W.: Principled Constructive Induction, in Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89), Morgan Kaufmann, Los Altos, CA, 651–656, 1989.
Muggleton, S.: Duce, An Oracle-based Approach to Constructive Induction, in Proceedings of the 10th International Joint Conference on Artificial Intelligence (IJCAI-87), Morgan Kaufmann, Los Altos, CA, p.287–292, 1987.
Muggleton, S., Buntine, W.: Machine Invention of First Order Predicates by Inverting Resolution, in Laird, J.(ed.), Proceedings of the Fifth International Conference on Machine Learning, Univ.of Michigan, Ann Arbor, June 12–14, Morgan Kaufmann, San Mateo, CA, pp. 339–352, 1988.
Prem, E., Mackinger, M., Dorffner, G., Porenta, G., Sochor, H.: Concept Support as a Method for Programming Neural Networks with Symbolic Knowledge, in Ohlbach, H.J.(ed.), GWAI-92: Advances in Artificial Intelligence, Springer, Berlin, Lecture Notes in AI, Vol. 671, 1993.
Quinlan, J.R., Rivest, R.L.: Inferring Decision Trees using the Minimum Description Length Principle, in Information and Computation, 80:227–248, 1989.
Quinlan, J.R., Cameron-Jones, R.M.: FOIL: A Midterm Report, in Brazdil, P.B.(ed.), Machine Learning: ECML-93, Springer, Berlin, pp. 3–20, 1993.
Quinlan, J.R.: C4.5: Programs for Machine Learning, Morgan Kaufmann, San Mateo, CA, 1993.
Rissanen, J.: Modeling by Shortest Data Description, in Automatica, 14:465–471, 1978.
Tangkitvanich, S., Shimura, M.: Learning from an Approximate Theory and Noisy Examples, in Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), AAAI Press/MIT Press, Menlo Park, CA, pp. 466–471, 1993.
Thrun S.B., et.al.: The MONK's Problems: A Performance Comparison of Different Learning Algorithms, CMU Tech Report, CMU-CS-91-197, 1991.
Watanabe, L., Rendell, L.: Learning Structural Decision Trees from Examples, in Proceedings of the 12th International Conference on Artificial Intelligence, Morgan Kaufmann, San Mateo, CA, pp. 770–776, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pfahringer, B. (1994). Controlling constructive induction in CIPF: An MDL approach. In: Bergadano, F., De Raedt, L. (eds) Machine Learning: ECML-94. ECML 1994. Lecture Notes in Computer Science, vol 784. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57868-4_62
Download citation
DOI: https://doi.org/10.1007/3-540-57868-4_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57868-0
Online ISBN: 978-3-540-48365-6
eBook Packages: Springer Book Archive