A Projection Pursuit Forest Algorithm for Supervised Classification
Not on the map. Why?
Abstract (arXiv)
This paper presents a new ensemble learning method for classification problems called projection pursuit random forest (PPF). PPF uses the PPtree algorithm introduced in Lee et al. (2013). In PPF, 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. Utilizing 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 (R Core Team, 2018) package, PPforest, which is available on CRAN, with development versions at https://github.com/natydasilva/PPforest.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 19 Jul 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
4 papers.
- 2025Projection Pursuit Density Ratio Estimationcited by 5
- 2022Exploring Local Explanations of Nonlinear Models Using Animated Linear Projectionscited by 2
- 2022Biased Hypothesis Formation From Projection Pursuitcited by 0
- 2026An Enhanced Projection Pursuit Tree Classifier with Visual Methods for Assessing Algorithmic Improvementscited by 0
- 2026An Enhanced Projection Pursuit Tree Classifier with Visual Methods for Assessing Algorithmic Improvements24 Feb 2026
- 2025Projection Pursuit Density Ratio Estimation1 Jun 2025
- 2022Exploring Local Explanations of Nonlinear Models Using Animated Linear Projections11 May 2022
- 2022Biased Hypothesis Formation From Projection Pursuit3 Jan 2022