Maximal tree construction

The construction starts at the root node of the tree, where all the available (x, y) pairs are initially placed. One identifies the particular split or test, s, that maximizes a given measure of information gain (Shannon and Weaver, 1964), 0(.s). The definition of a split, s, involves both the choice of the decision variable and the threshold to be used. Then, the (x, y) root node pairs are divided according to the best split found, and assigned to one of the children nodes emanating fi-om it. The information gain measure, 0is), for a particular parent node t, is... 

---