Inferring decision trees using the minimum description length principle
From MaRDI portal
Cites work
- 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
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Modeling by shortest data description
- Stochastic complexity and modeling
- Universal modeling and coding
Cited in
(29)- Averaging over decision trees
- Inductive reasoning and Kolmogorov complexity
- Logical analysis of numerical data
- Stochastic complexity in learning
- Applying MDL to learn best model granularity
- Feature Subset Selection by Bayesian network-based optimization
- Open problems in universal induction \& intelligence
- Learning decision trees from random examples
- Development of inductive inference algorithms using decision trees
- Local discriminant bases and their applications
- A comparison of pruning criteria for probability trees
- Towards adaptive Web sites: Conceptual framework and case study
- `Ideal learning' of natural language: positive results about learning from positive evidence
- Suboptimal behavior of Bayes and MDL in classification under misspecification
- The effects of pruning methods on the predictive accuracy of induced decision trees
- CPD tree learning using contexts as background knowledge
- Hierarchical linear support vector machine
- Teaching and Compressing for Low VC-Dimension
- An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle
- Fuzzy partitioning of continuous attributes through discretization methods to construct fuzzy decision tree classifiers
- Context-specific and local independence in Markovian dependence structures
- Explanatory and creative alternatives to the MDL principle
- Discovering unbounded unions of regular pattern languages from positive examples
- Parallel construction of decision trees with consistently non-increasing expected number of tests
- Assessing hierarchies by their consistent segmentations
- A machine discovery from amino acid sequences by decision trees over regular patterns
- An empirical comparison of cost functions in inductive logic programming
- Results on learnability and the Vapnik-Chervonenkis dimension
- Maximum a posteriori pruning on decision trees and its application to bootstrap bumping
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)
