C4.5: programs for machine learning
C4.5: programs for machine learning
Modeling Cognitive Development on Balance Scale Phenomena
Machine Learning - Special issue on computational models of human learning
Efficient incremental induction of decision trees
Machine Learning
Machine Learning
Incremental Induction of Decision Trees
Machine Learning
ICDAR '95 Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 1) - Volume 1
Concept acquisition through representational adjustment
Concept acquisition through representational adjustment
A learning system and its psychological implications
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
We explore the problem of learning decision trees using a Bayesian approach, called TREBBLE (TREe Building by Bayesian LE- arning), in which a population of decision trees is generated by constructing trees using probability distributions at each node. Predictions are made either by using Bayesian Model Averaging to combine information from all the trees (TREBBLE-BMA) or by using the single most likely tree (TREBBLE-MAP), depending on what is appropriate for the particular application domain. We show on benchmark data sets that this method is more accurate than the traditional decision tree learning algorithm C4.5 and is as accurate as the Bayesian method SimTree while being much simpler to understand and implement. In many application domains, such as help-desks and medical diagnoses, a decision tree needs to be learned from a prior tree (provided by an expert) and some (usually small) amount of training data. We show how TREBBLE-MAP can be used to learn a single tree that performs better than using either the prior tree or the training data alone.