Enhancement of Random Forests Using Trees with Oblique Splits
This work presents an enhancement to the classification tree algorithm which forms the basis for Random Forests. Differently from the classical tree-based methods that focus on one variable at a time to separate the observations, the new algorithm performs the search for the best split in two-dimens...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
DigitalCommons@USU
2013
|
| Subjects: | |
| Online Access: | http://digitalcommons.usu.edu/etd/1508 http://digitalcommons.usu.edu/cgi/viewcontent.cgi?article=2540&context=etd |
| Summary: | This work presents an enhancement to the classification tree algorithm which forms the basis for Random Forests. Differently from the classical tree-based methods that focus on one variable at a time to separate the observations, the new algorithm performs the search for the best split in two-dimensional space using a linear combination of variables. Besides the classification, the method can be used to determine variables interaction and perform feature extraction. Theoretical investigations and numerical simulations were used to analyze the properties and performance of the new approach. Comparison with other popular classification methods was performed using simulated and real data examples. The algorithm was implemented as an extension package for the statistical computing environment R and is available for free download under the GNU General Public License. |
|---|