Tree-AS node - basics

Specify the basic options about how the decision tree is to be built.

Tree growing algorithm Select the type of CHAID algorithm you want to use. Exhaustive CHAID is a modification of CHAID that does a more thorough job of examining all possible splits for each predictor but takes longer to compute.

Maximum tree depth Specify the maximum number of levels below the root node (the number of times the sample is split recursively); the default is 5. The maximum number of levels (also referred to as nodes) is 50,000.

Binning If you use continuous data, you must bin the inputs. You can do this in a preceding node; however, the Tree-AS node automatically bins any continuous inputs. If you use the Tree-AS node to automatically bin the data, select the Number of bins into which the inputs are to be divided. Data is divided into bins with equal frequency; the available options are 2, 4, 5, 10, 20, 25, 50, or 100.