Example: quiz answers
Classification and regression trees

Classification and regression trees

Back to document page

an ordered variable, its data values in the node are split into 10 intervals and one child node is assigned to each interval. If X is unordered, one child node is assigned to each value of X. Then, CHAID uses significance tests and Bonferroni corrections to try to iteratively merge pairs of child nodes. This approach has two consequences.

  Classification, Ordered

Download Classification and regression trees


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries