The chapter concludes with a review of several prediction task requirements that are closely related to on line classification, but that are outside the scope of this framework. Section 2.1 presents an example that will help to tie in the discussions within this and other chapters in this thesis. Sections 2.2, 2.3, 2.4 describe the input, output and control requirements for these tasks. Decision trees are represented with nodes that are connected by branches. Nodes may be either internal nodes or leaf nodes.
Internal nodes contain a test that creates two or more branches to other nodes.
Each internal node or leaf node must be referenced by only one other internal node. S K. Murthy. On Growing Better Decision Trees from Data . PhD thesis, John Hopkins University, 1995. In this paper, we restrict our attention to decision trees.