In this paper, we present a method for generating very expressive decision trees over a functional logic language. The generation of the tree follows a short-to-long search which is guided by the MDL principle. Once a solution is found, the construction of the tree goes on in order to obtain more solutions ordered as well by description length. The result is a multi-tree which is populated taking into consideration computational resources according to a Levin search. Some experiments show that the method pays off in practice. © 2002 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Ferri-Ramírez, C., Hernández-Orallo, J., & Ramírez-Quintana, M. J. (2002). Induction of decision multi-trees using levin search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2329 LNCS, pp. 166–175). Springer Verlag. https://doi.org/10.1007/3-540-46043-8_16
Mendeley helps you to discover research relevant for your work.