Algorithms for optimal dyadic decision trees
From MaRDI portal
Recommendations
- Optimal dyadic decision trees
- Minimax-optimal classification with dyadic decision trees
- Approximating Optimal Binary Decision Trees
- Approximating optimal binary decision trees
- scientific article; zbMATH DE number 1192315
- Learning Theory
- scientific article; zbMATH DE number 708667
- Optimal decision trees for the algorithm selection problem: integer programming based approaches
- On Optimization of Decision Trees
Cites work
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 1149421 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- A Partitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees
- An Algorithm for Constructing Optimal Binary Decision Trees
- CART and best-ortho-basis: a connection
- Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time
- Conversion of Limited-Entry Decision Tables to Optimal Computer Programs II
- Minimax-optimal classification with dyadic decision trees
- Optimal Binary Identification Procedures
- Optimal conversion of extended-entry decision tables with general cost criteria
- Optimal dyadic decision trees
- The synthetic approach to decision table conversion
Cited in
(12)- scientific article; zbMATH DE number 1192315 (Why is no real title available?)
- The decision tree polytope and its application to sequential decision problems
- Decision trees with optimal joint partitioning
- Taiga: performance optimization of the C4.5 decision tree construction algorithm
- Optimization and analysis of decision trees and rules: dynamic programming approach
- Plug-and-play dual-tree algorithm runtime analysis
- Fast computation in adaptive tree approximation
- Optimal dyadic decision trees
- Learning Theory
- Algorithms for learning parsimonious context trees
- Minimax-optimal classification with dyadic decision trees
- scientific article; zbMATH DE number 1700378 (Why is no real title available?)
This page was built for publication: Algorithms for optimal dyadic decision trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1959591)