Optimal Binary Identification Procedures

By M. Garey. 1972

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

MurTree: Optimal Decision Trees via Dynamic Programming and Search (2020, background): “Framing the problem as a dynamic program dates from the 1970s (e.g., Garey (1972)), but the description in works afterwards deviated as new techniques were introduced.”
Generalized and Scalable Optimal Sparse Decision Trees (2020, methodology): “Dynamic programming methods have been used for various decision tree optimization problems since as far back as the early 1970’s (Garey, 1972; Meisel & Michalopoulos, 1973).”
MurTree: Optimal Classification Trees via Dynamic Programming and Search (2020, methodology): “up the computation of instances per node and used a caching technique similar to DL8 (Nijssen and Fromont (2007)), Hu et al. (2019) presented an algorithm that computes the optimal decision tree by considering a balance between misclassifications and number of nodes.”
Adaptive and Generic Corner Detection Based on the Accelerated Segment Test (2010, methodology): “There are several solutions towards finding the optimal tree [16–18], but they are either approximations to the global optimum or are restricted to special cases, making them ill-suited for this application.”
Optimal constraint-based decision tree induction from itemset lattices (2010, methodology): “In most cases, the constraint ϕ( T ) is a conjunction of a number of independent constraints, which can have the following properties.”
On Explaining Decision Trees (2020, background): “Decision trees (DTs) are well known machine learning (ML) models, studied since at least the 1970s [22,27,14,51,53].”
Mining optimal decision trees from itemset lattices (2007, background): “The search for optimal decision trees dates back to the 70s, when several dynamic programming algorithms for building such trees were proposed [9, 16, 26, 30, 15].”
From Small-World Networks to Comparison-Based Search (2011, background): “Arguably, the first oracle considered to model such methods is the so-called membership oracle [13], which allows the search mechanism to ask a user questions of the form “does the target belong to set A” (see also our discussion in Section III-D).”