Coding decision trees

DOI10.1023/A:1022646101185MaRDI QIDQ2366677zbMATH OpenFDO

Authors Yanyan Li

Publication date 18 August 1993

Published in Machine Learning (Search for Journal in Brave)

Mathematics Subject Classification ID

Bayesian inference (62F15) Coding theorems (Shannon theory) (94A24)

Cited in

(11)

• Analysis of negative correlation learning
• From designing a single neural network to designing neural network ensembles
• Causal discovery through MAP selection of stratified chain event graphs
• Local discriminant bases and their applications
• Minimum message length shrinkage estimation
• Minimum message length inference of the Poisson and geometric models using heavy-tailed prior distributions
• Suboptimal behavior of Bayes and MDL in classification under misspecification
• Averaging over decision trees
• A comparison of pruning criteria for probability trees
• An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle
• The effects of pruning methods on the predictive accuracy of induced decision trees

This page was built for publication: Coding decision trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366677)