The posterior distribution over hypotheses given certain test results is the empirical one determined by the training data. This is the approach taken here. Improving on greedy induction Most tree induction systems use a greedy approach trees are induced top down, a node at a time. The problem of inducing globally optimal decision trees has been addressed time and again. 33 the data, there exists a member of S that induces the partition.
Performance bounds on the splitting algorithm for binary testing .
Let M denote the number of possible hypotheses and let N denote the number of possible questions, each of which divides the set of hypotheses into two groups. There is also an initial distribution 0 over hypotheses. M. R. Garey and R. L. Graham. Performance bounds on the splitting algorithm for binary testing . Performance bounds on the splitting algorithm for binary testing .