Search

Summary

Tree-based methods use methodologies that are radically different from those discussed in previous chapters. They are relatively easy to use and can be applied to a wide class of problems. As with many of the new machine learning methods, construction of a tree, or (in the random forest approach, trees) follows an algorithmic process. Single-tree methods occupy the first part this chapter. An important aspect of the methodology is the determining of error estimates. By building a large number of trees and using a voting process to make predictions, the random forests methodology that occupies the latter part of this chapter can often greatly improve on what can be achieved with a single tree. The methodology operates more as a black box, but with implementation details that are simpler to describe than for single- tree methods. In large sample classification problems, the methodology has often proved superior to other contenders.

Search Results

Refine search

Refine search

Actions for selected content:

1 results

8 - Tree-Based Classification and Regression

Summary

Search Results

Refine search

Refine search

Actions for selected content:

Save Search

1 results

8 - Tree-Based Classification and Regression

Summary