4.5 Article

A Projection Pursuit Forest Algorithm for Supervised Classification

期刊

出版社

TAYLOR & FRANCIS INC
DOI: 10.1080/10618600.2020.1870480

关键词

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

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据