Transcription of Classification and regression trees
{{id}} {{{paragraph}}}
Overview Classification and regression trees Wei-Yin Loh Classification and regression trees are machine-learning methods for constructing prediction models from data. The models are obtained by recursively partitioning the data space and fitting a simple prediction model within each partition. As a result, the partitioning can be represented graphically as a decision tree. Clas- sification trees are designed for dependent variables that take a finite number of unordered values, with prediction error measured in terms of misclassifica- tion cost. regression trees are for dependent variables that take continuous or ordered discrete values, with prediction error typically measured by the squared difference between the observed and predicted values. This article gives an in- troduction to the subject by reviewing some widely available algorithms and comparing their capabilities, strengths, and weakness in two examples. C 2011 John Wiley & Sons, Inc.
whereas GUIDE can split on combinations of two variables at a time. If there are missing values, CART and CRUISE use alternate splits on other variables when needed, C4.5 sends each observation with a missing value in a split through every branch using Volume 1, January/February 2011 2011 John Wiley & …
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}
Hilti - 2011 Anchor Fastening Technical Guide, Anchor Fastening Technical Guide, Anchor Fastening Technical Guide 2011, Condominium project approval and processing, Condominium Project Approval and Processing Guide, GUIDE, Strategies to Increase Physical Activity, Strategies to Increase Physical Activity in the Community, 2011, Regulation Guide, Paperwork Reduction Act, GUIDE TO GOOD DAIRY FARMING PRACTICE