data mining 38
1. Draw the full decision tree for the parity function of four Boolean attributes, A, B, C, and D. Is it possible to simplify the tree? 6. Consider the following set of training examples (see table in the book). (a) Compute a two-level decision tree using the greedy approach described in this chapter. Use the […]
