Keywords
Binary decision diagramNP-completeBinary search treeComputer scienceMathematicsBinary numberDecision treeComputational complexity theoryDecision problemTernary search treeCombinatoricsBinary treeTheoretical computer scienceAlgorithmArtificial intelligenceArithmeticInterval treeTree structure
Affiliated Institutions
Related Publications
OC1: randomized induction of oblique decision trees
This paper introduces OC1, a new algorithm for generating multivariate decision trees. Multivariate trees classify examples by testing linear combinations of the features at eac...
Best-first Decision Tree Learning
Decision trees are potentially powerful predictors and explicitly represent the structure of a dataset. Standard decision tree learners such as C4.5 expand nodes in depth-first ...
CLOUDS: a decision tree classifier for large datasets
Classification for very large datasets has many practical applications in data mining. Techniques such as discretization and dataset sampling can be used to scale up decision tr...
A Communication-Efficient Parallel Algorithm for Decision Tree
Decision tree (and its extensions such as Gradient Boosting Decision Trees and Random Forest) is a widely used machine learning algorithm, due to its practical effectiveness and...
Programs for Machine Learning
Algorithms for constructing decision trees are among the most well known and widely used of all machine learning methods. Among decision tree algorithms, J. Ross Quinlan's ID3 a...
Publication Info
- Year
- 1976
- Type
- article
- Volume
- 5
- Issue
- 1
- Pages
- 15-17
- Citations
- 939
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
939
OpenAlex
Cite This
Laurent Hyafil,
Ronald L. Rivest
(1976).
Constructing optimal binary decision trees is NP-complete.
Information Processing Letters
, 5
(1)
, 15-17.
https://doi.org/10.1016/0020-0190(76)90095-8
Identifiers
- DOI
- 10.1016/0020-0190(76)90095-8