Algorithms for optimal dyadic decision trees

DOI10.1007/s10994-010-5167-xzbMath1470.68117OpenAlexW2054277488MaRDI QIDQ1959591

Don Hush, Reid Porter

Publication date: 7 October 2010

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-010-5167-x

zbMATH Keywords

classificationlearning algorithmdecision tree

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Algorithms for learning parsimonious context trees

Uses Software

• UCI-ml
• C4.5

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• CART and best-ortho-basis: a connection
• Optimal dyadic decision trees
• Minimax-optimal classification with dyadic decision trees
• The synthetic approach to decision table conversion
• An Algorithm for Constructing Optimal Binary Decision Trees
• Optimal conversion of extended-entry decision tables with general cost criteria
• Conversion of Limited-Entry Decision Tables to Optimal Computer Programs II
• Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time
• Optimal Binary Identification Procedures
• A Partitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees

This page was built for publication: Algorithms for optimal dyadic decision trees