An Algorithm for Constructing Optimal Binary Decision Trees

DOI10.1109/TC.1977.1674938MaRDI QIDQ4138195zbMATH OpenOpenAlexFDO

Authors H. J. Payne, William S. Meisel

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

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

Cited in

(8)

• An algorithm to detect linearly separable clusters of binary patterns
• The optimal strategy of a tree classifier
• Algorithms for optimal dyadic decision trees
• Optimization problems for machine learning: a survey
• Column generation based heuristic for learning classification trees
• Cellular tree classifiers
• scientific article; zbMATH DE number 3759389 (Why is no real title available?)
• Optimal classification trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138195)