Pages that link to "Item:Q1228355"
From MaRDI portal
The following pages link to Constructing optimal binary decision trees is NP-complete (Q1228355):
Displayed 30 items.
- 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)
- 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)
- Learning local transductions is hard (Q1770836) (← 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)
- Computer science and decision theory (Q2271874) (← links)
- An experimental evaluation of simplicity in rule learning (Q2389614) (← links)
- Inductive learning models with missing values (Q2426056) (← links)
- Approximating optimal binary decision trees (Q2428690) (← links)
- Minimization of decision trees is hard to approximate (Q2475411) (← links)
- Modular learning models in forecasting natural phenomena. (Q2490831) (← links)
- Solving feature subset selection problem by a parallel scatter search (Q2570148) (← links)
- Efficient sequential decision-making algorithms for container inspection operations (Q2892126) (← links)
- Decision Trees for Geometric Models (Q4513214) (← links)
- Decision tree approximations of Boolean functions (Q5958322) (← links)