An Algorithm for Constructing Optimal Binary Decision Trees

DOI10.1109/TC.1977.1674938zbMath0363.68131OpenAlexW193579291MaRDI QIDQ4138195

William S. Meisel, H. J. Payne

Publication date: 1977

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1977.1674938

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Linear regression; mixed models (62J05) Decision theory (91B06) Pattern recognition, speech recognition (68T10) Hamilton-Jacobi theories (49L99) Algorithms in computer science (68W99)

Related Items (8)

Cellular tree classifiers ⋮ Algorithms for optimal dyadic decision trees ⋮ Unnamed Item ⋮ Optimal classification trees ⋮ Optimization problems for machine learning: a survey ⋮ Column generation based heuristic for learning classification trees ⋮ An algorithm to detect linearly separable clusters of binary patterns ⋮ The optimal strategy of a tree classifier

This page was built for publication: An Algorithm for Constructing Optimal Binary Decision Trees