4.5 Article

A Projection Pursuit Forest Algorithm for Supervised Classification

Journal

JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS
Volume 30, Issue 4, Pages 1168-1180

Publisher

TAYLOR & FRANCIS INC
DOI: 10.1080/10618600.2020.1870480

Keywords

Data mining; Ensemble model; Exploratory data analysis; High-dimensional data; Statistical computing

Ask authors/readers for more resources

The article introduces a new ensemble learning method called PPF, which uses linear combinations of variables to construct trees and choose the best projection to separate classes, outperforming traditional random forests in cases of variable correlations and separations between groups.
This article presents a new ensemble learning method for classification problems called projection pursuit random forest (PPF). PPF uses the PPtree algorithm where trees are constructed by splitting on linear combinations of randomly chosen variables. Projection pursuit is used to choose a projection of the variables that best separates the classes. Using linear combinations of variables to separate classes takes the correlation between variables into account which allows PPF to outperform a traditional random forest when separations between groups occurs in combinations of variables. The method presented here can be used in multi-class problems and is implemented into an R package, PPforest, which is available on CRAN. Supplementary files for this article are available online.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available