Optimal Binary Identification Procedures
From MaRDI portal
Publication:5637903
DOI10.1137/0123019zbMath0229.68037OpenAlexW2018571947MaRDI QIDQ5637903
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
Related Items (28)
Decision trees with minimum average depth for sorting eight elements ⋮ Sequential testing of complex systems: a review ⋮ Diagnosis of three types of constant faults in read-once contact networks over finite bases ⋮ Performance bounds for binary testing with arbitrary weights ⋮ On the hardness of the minimum height decision tree problem ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Point probe decision trees for geometric concept classes ⋮ Diagnosis of constant faults in iteration-free circuits over monotone basis ⋮ Totally optimal decision trees for Boolean functions ⋮ Optimization and analysis of decision trees and rules: dynamic programming approach ⋮ 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 ⋮ Approximating optimal binary decision trees ⋮ A binary decision algorithm ⋮ Algorithms for optimal dyadic decision trees ⋮ A note on data structures for maintaining bipartitions ⋮ Some Completeness Results on Decision Trees and Group Testing ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ Unnamed Item ⋮ Bi-criteria optimization of decision trees with applications to data analysis ⋮ The binary identification problem for weighted trees ⋮ Optimal binary search trees ⋮ Constructing optimal binary decision trees is NP-complete ⋮ On Polynomial Time Constructions of Minimum Height Decision Tree ⋮ Hierarchical testing designs for pattern recognition ⋮ Diagnosis of constant faults in read-once contact networks over finite bases ⋮ Approximating decision trees with value dependent testing costs
This page was built for publication: Optimal Binary Identification Procedures
