Optimal Binary Identification Procedures

DOI10.1137/0123019MaRDI QIDQ5637903zbMATH OpenOpenAlexFDO

Authors M. R. Garey

Publication date 1972

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0123019

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cited in

(29)

• Performance bounds for binary testing with arbitrary weights
• Constructing optimal binary decision trees is NP-complete
• Decision trees for function evaluation: simultaneous optimization of worst and expected cost
• Trading off worst and expected cost in decision tree problems
• Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions
• Bi-criteria optimization of decision trees with applications to data analysis
• The binary identification problem for weighted trees
• Sequential testing of complex systems: a review
• On the hardness of the minimum height decision tree problem
• Algorithms for optimal dyadic decision trees
• Diagnosis of constant faults in read-once contact networks over finite bases
• Approximating decision trees with value dependent testing costs
• Approximating optimal binary decision trees
• Hierarchical testing designs for pattern recognition
• Exact learning from an honest teacher that answers membership queries
• Diagnosis of constant faults in iteration-free circuits over monotone basis
• Decision trees with minimum average depth for sorting eight elements
• Diagnosis of three types of constant faults in read-once contact networks over finite bases
• Totally optimal decision trees for Boolean functions
• Some Completeness Results on Decision Trees and Group Testing
• Improved approximation algorithms for the average-case tree searching problem
• scientific article; zbMATH DE number 7625179 (Why is no real title available?)
• Point probe decision trees for geometric concept classes
• On Polynomial Time Constructions of Minimum Height Decision Tree
• Optimization and analysis of decision trees and rules: dynamic programming approach
• Optimal binary search trees
• Old and new results on alphabetic codes
• A binary decision algorithm
• A note on data structures for maintaining bipartitions

This page was built for publication: Optimal Binary Identification Procedures

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