Inferring decision trees using the minimum description length principle

DOI10.1016/0890-5401(89)90010-2zbMath0664.94015OpenAlexW1983661866MaRDI QIDQ1115845

Ronald L. Rivest, J. Ross Quinlan

Publication date: 1989

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(89)90010-2

zbMATH Keywords

coding methods

Mathematics Subject Classification ID

Trees (05C05) Decision theory (91B06) Communication, information (94A99) Statistical decision theory (62Cxx)

Related Items (25)

CPD Tree Learning Using Contexts as Background Knowledge ⋮ Unnamed Item ⋮ `Ideal learning' of natural language: positive results about learning from positive evidence ⋮ Suboptimal behavior of Bayes and MDL in classification under misspecification ⋮ Development of inductive inference algorithms using decision trees ⋮ Local discriminant bases and their applications ⋮ Logical analysis of numerical data ⋮ Stochastic complexity in learning ⋮ Open problems in universal induction \& intelligence ⋮ An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle ⋮ Averaging over decision trees ⋮ Teaching and Compressing for Low VC-Dimension ⋮ A comparison of pruning criteria for probability trees ⋮ Hierarchical linear support vector machine ⋮ Towards adaptive Web sites: Conceptual framework and case study ⋮ Inductive reasoning and Kolmogorov complexity ⋮ Fuzzy partitioning of continuous attributes through discretization methods to construct fuzzy decision tree classifiers ⋮ Maximum a posteriori pruning on decision trees and its application to bootstrap bumping ⋮ A machine discovery from amino acid sequences by decision trees over regular patterns ⋮ Explanatory and creative alternatives to the MDL principle ⋮ Context-Specific and Local Independence in Markovian Dependence Structures ⋮ Results on learnability and the Vapnik-Chervonenkis dimension ⋮ Learning decision trees from random examples ⋮ Applying MDL to learn best model granularity ⋮ Feature Subset Selection by Bayesian network-based optimization

Cites Work

• Unnamed Item
• Unnamed Item
• A universal prior for integers and estimation by minimum description length
• Stochastic complexity and modeling
• Modeling by shortest data description
• Constructing optimal binary decision trees is NP-complete
• Universal modeling and coding
• An information measure for single link classification
• An Information Measure for Classification

This page was built for publication: Inferring decision trees using the minimum description length principle