Efficient decision tree design for discrete variable pattern recognition problems

DOI10.1016/0031-3203(77)90004-8zbMath0383.68070OpenAlexW2072471629MaRDI QIDQ1248377

B. Chatterje, Ishwar K. Sethi

Publication date: 1978

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0031-3203(77)90004-8

Mathematics Subject Classification ID

Trees (05C05) Decision theory (91B06) Pattern recognition, speech recognition (68T10) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

Cellular tree classifiers ⋮ The optimal strategy of a tree classifier

Cites Work

• Optimum binary search trees
• A Classifier Design Technique for Discrete Variable Pattern Recognition Problems
• Conversion of limited-entry decision tables to computer programs
• 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
• A Partitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees
• Information theory applied to the conversion of decision tables to computer programs

This page was built for publication: Efficient decision tree design for discrete variable pattern recognition problems