Pages that link to "Item:Q1115845"
From MaRDI portal
The following pages link to Inferring decision trees using the minimum description length principle (Q1115845):
Displaying 28 items.
- Hierarchical linear support vector machine (Q454434) (← links)
- Fuzzy partitioning of continuous attributes through discretization methods to construct fuzzy decision tree classifiers (Q506780) (← links)
- A machine discovery from amino acid sequences by decision trees over regular patterns (Q688817) (← links)
- Results on learnability and the Vapnik-Chervonenkis dimension (Q751859) (← links)
- Maximum a posteriori pruning on decision trees and its application to bootstrap bumping (Q959196) (← links)
- Averaging over decision trees (Q1126405) (← links)
- Inductive reasoning and Kolmogorov complexity (Q1190991) (← links)
- Logical analysis of numerical data (Q1365054) (← links)
- Stochastic complexity in learning (Q1370860) (← links)
- Applying MDL to learn best model granularity (Q1583224) (← links)
- Feature Subset Selection by Bayesian network-based optimization (Q1589473) (← links)
- Open problems in universal induction \& intelligence (Q1662486) (← links)
- Learning decision trees from random examples (Q1823009) (← links)
- Development of inductive inference algorithms using decision trees (Q1899900) (← links)
- Local discriminant bases and their applications (Q1904368) (← links)
- A comparison of pruning criteria for probability trees (Q1959552) (← links)
- Towards adaptive Web sites: Conceptual framework and case study (Q1978793) (← links)
- `Ideal learning' of natural language: positive results about learning from positive evidence (Q2382634) (← links)
- Suboptimal behavior of Bayes and MDL in classification under misspecification (Q2384137) (← links)
- (Q2711697) (← links)
- CPD Tree Learning Using Contexts as Background Knowledge (Q3451194) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle (Q4831995) (← links)
- Context-Specific and Local Independence in Markovian Dependence Structures (Q5213647) (← links)
- Explanatory and creative alternatives to the MDL principle (Q5938216) (← links)
- Discovering unbounded unions of regular pattern languages from positive examples (Q6487429) (← links)
- Parallel construction of decision trees with consistently non-increasing expected number of tests (Q6574687) (← links)
- Assessing hierarchies by their consistent segmentations (Q6596056) (← links)
