Inferring decision trees using the minimum description length principle
Information and Computation
C4.5: programs for machine learning
C4.5: programs for machine learning
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Decision Tree Induction Based on Efficient Tree Restructuring
Machine Learning
Artificial intelligence: a new synthesis
Artificial intelligence: a new synthesis
Learning Logical Definitions from Relations
Machine Learning
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Shared Ensemble Learning Using Multi-trees
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
SMILES: A Multi-purpose Learning System
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
From Ensemble Methods to Comprehensible Models
DS '02 Proceedings of the 5th International Conference on Discovery Science
A survey of cost-sensitive decision tree induction algorithms
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
In this paper, we present a method for generating very expressiv e decision trees over a functional logic language. The generation of the tree follo ws 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.