I have a problem understanding how to draw a recursive representation of the regression tree corresponding to the greedy recursive partitioning procedure with respect to square error.

For example, given the following data set $${((1, 1),9), ((1,2), -4), ((1,3),2), ((2,2),4), ((2,3), 2)} $$ how would one approach drawing the regression tree and its binary representation?

Would the following representations be correct where the number in each leaf is the mean of the response for the observations that fall there.

enter image description here


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.