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: | Parfionovas, Andrejus |
---|---|
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 |
Similar Items
-
Enhancement of Random Forests Using Trees with Oblique Splits
by: Parfionovas, Andrejus
Published: (2013) -
Fast growing and interpretable oblique trees via logistic regression models
by: Truong, Alfred Kar Yin
Published: (2009) -
Oblique decision trees in transformed spaces.
by: Wickramarachchi, Darshana Chitraka
Published: (2015) -
Classification of objects, given their classification by a number of classifiers /
by: Quadri, Syed Samiullah
Published: (1984) -
History and properties of random recursive trees
by: Wikström, Victor
Published: (2020)