Developing an “average out and fold back” algorithm in R

Hi! I am curious as to whether someone would be interested in exploring the development of a “fold back” algorithm for the solution to the decision tree in R. Given the tree structure , the algorithm should be able to move backwards from the terminal nodes and estimate the expected value at a given chance node. Please post alternative solutions to the comments below .
Thank you!

Close Menu