Inferring decision trees using the minimum description length principle

DOI10.1016/0890-5401(89)90010-2MaRDI QIDQ1115845zbMATH OpenOpenAlexFDO

Authors J. Ross Quinlan, Ronald L. Rivest

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

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

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A universal prior for integers and estimation by minimum description length
• An Information Measure for Classification
• An information measure for single link classification
• Constructing optimal binary decision trees is NP-complete
• Modeling by shortest data description
• Stochastic complexity and modeling
• Universal modeling and coding

Cited in

(28)

• Maximum a posteriori pruning on decision trees and its application to bootstrap bumping
• Teaching and Compressing for Low VC-Dimension
• Parallel construction of decision trees with consistently non-increasing expected number of tests
• Applying MDL to learn best model granularity
• Context-specific and local independence in Markovian dependence structures
• Open problems in universal induction \& intelligence
• Learning decision trees from random examples
• Assessing hierarchies by their consistent segmentations
• `Ideal learning' of natural language: positive results about learning from positive evidence
• Results on learnability and the Vapnik-Chervonenkis dimension
• Local discriminant bases and their applications
• Development of inductive inference algorithms using decision trees
• Hierarchical linear support vector machine
• Discovering unbounded unions of regular pattern languages from positive examples
• Towards adaptive Web sites: Conceptual framework and case study
• Inductive reasoning and Kolmogorov complexity
• Logical analysis of numerical data
• CPD tree learning using contexts as background knowledge
• Explanatory and creative alternatives to the MDL principle
• Suboptimal behavior of Bayes and MDL in classification under misspecification
• Averaging over decision trees
• A comparison of pruning criteria for probability trees
• Fuzzy partitioning of continuous attributes through discretization methods to construct fuzzy decision tree classifiers
• Feature Subset Selection by Bayesian network-based optimization
• An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle
• Stochastic complexity in learning
• A machine discovery from amino acid sequences by decision trees over regular patterns
• The effects of pruning methods on the predictive accuracy of induced decision trees

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

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