Learning classification trees

Research output: Contribution to journalArticleResearchpeer-review

229 Citations (Scopus)


Algorithms for learning classification trees have had successes in artificial intelligence and statistics over many years. This paper outlines how a tree learning algorithm can be derived using Bayesian statistics. This introduces Bayesian techniques for splitting, smoothing, and tree averaging. The splitting rule is similar to Quinlan's information gain, while smoothing and averaging replace pruning. Comparative experiments with reimplementations of a minimum encoding approach, c4 (Quinlan et al., 1987) and cart (Breiman et al., 1984), show that the full Bayesian algorithm can produce more accurate predictions than versions of these other approaches, though pays a computational price.

Original languageEnglish
Pages (from-to)63-73
Number of pages11
JournalStatistics and Computing
Issue number2
Publication statusPublished - 1 Jun 1992


  • Bayesian statistics
  • Classification trees

Cite this