Scribd
Upload
21 views

03_Concepts

Uploaded by

Matías Aco
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

03_Concepts

Uploaded by

Matías Aco
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Steps

1. We divide the predictor space—that is, the set of possible values for
X1,X2, . . .,Xp—into J distinct and non-overlapping regions,
R1,R2, . . . , RJ .

2. For every observation that falls into the region Rj, we make the same
prediction, which is simply the mean of the response values for the
training observations in Rj .

Goal is to minimize RSS

Start-Tech Academy
Building tree

Mean score 39

Mean score 75

Start-Tech Academy
Approach

• Top-down, greedy approach that is known as recursive binary


splitting.
• Top-down because it begins at the top of the tree and then
successively splits the predictor space
• Each split is indicated via two new branches further down on the
tree.
• It is greedy because at each step of the tree-building process, the
best split is made at that particular step, rather than looking ahead
and picking a split that will lead to a better tree in some future step.

Start-Tech Academy
Steps

1. Considers all predictors and all possible cut point values


2. Calculates RSS for each possibility
3. Selects the one with least RSS
4. Continues till stopping criteria is reached

Start-Tech Academy

You might also like