Pages that link to "Item:Q1228355"
From MaRDI portal
The following pages link to Constructing optimal binary decision trees is NP-complete (Q1228355):
Displaying 50 items.
- Totally optimal decision trees for Boolean functions (Q323025) (← links)
- A multi-tree committee to assist port-of-entry inspection decisions (Q323142) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
- Searching in random partially ordered sets (Q596140) (← links)
- Logical analysis of data: classification with justification (Q646700) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- A note on the comparison of five heuristic optimization techniques of a certain class of decision trees (Q751318) (← links)
- Learning optimal decision trees using constraint programming (Q823772) (← links)
- Mathematical optimization in classification and regression trees (Q828748) (← links)
- Approximations to clustering and subgraph problems on trees (Q1056227) (← links)
- Performance bounds for binary testing with arbitrary weights (Q1083851) (← links)
- Discrete decision theory: manipulations (Q1102136) (← links)
- Inferring decision trees using the minimum description length principle (Q1115845) (← links)
- Wrappers for feature subset selection (Q1127360) (← links)
- Electronic circuit diagnostic expert systems - a survey (Q1262111) (← links)
- Reduction of the number of particles in the stochastic weighted particle method for the Boltzmann equation (Q1268322) (← links)
- Optimal mistake bound learning is hard (Q1271479) (← links)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
- Recognizing polygonal parts width measurements (Q1384211) (← links)
- Queries revisited. (Q1426146) (← links)
- Stochastic dynamic programming with factored representations (Q1583230) (← links)
- An improved test selection optimization model based on fault ambiguity group isolation and chaotic discrete PSO (Q1646468) (← links)
- HHCART: an oblique decision tree (Q1659462) (← links)
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost (Q1679228) (← links)
- Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions (Q1694833) (← links)
- Bi-criteria optimization of decision trees with applications to data analysis (Q1754136) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- Learning local transductions is hard (Q1770836) (← links)
- Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic (Q1791966) (← links)
- Sequential testing of complex systems: a review (Q1878412) (← links)
- Learning multicriteria classification models from examples: decision rules in continuous space (Q1885756) (← links)
- On the hardness of the minimum height decision tree problem (Q1885823) (← links)
- Learning decision trees with flexible constraints and objectives using integer optimization (Q2011578) (← links)
- Regularizing axis-aligned ensembles via data rotations that favor simpler learners (Q2029102) (← links)
- Optimization problems for machine learning: a survey (Q2029894) (← links)
- Decision trees based on 1-consequences (Q2043377) (← links)
- Optimal decision trees for categorical data via integer programming (Q2046341) (← links)
- Adaptive estimation of multivariate piecewise polynomials and bounded variation functions by optimal decision trees (Q2054517) (← links)
- Interpretable machine learning: fundamental principles and 10 grand challenges (Q2074414) (← links)
- Optimal survival trees (Q2102354) (← links)
- Shattering inequalities for learning optimal decision trees (Q2170186) (← links)
- Profit driven decision trees for churn prediction (Q2178124) (← links)
- Data science applications to string theory (Q2187812) (← links)
- A branch \& bound algorithm to determine optimal cross-splits for decision tree induction (Q2188762) (← links)
- End-to-end learning of decision trees and forests (Q2193582) (← links)
- \textsc{Treant}: training evasion-aware decision trees (Q2212514) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Column generation based heuristic for learning classification trees (Q2289946) (← links)
- Sparsity in optimal randomized classification trees (Q2301963) (← links)
