mlsanityData to 14 Oct 2026

A Projection Pursuit Forest Algorithm for Supervised Classification

arXiv 1807.07207 ↗First posted 19 Jul 2018stat.ML cs.LGcited by 4

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

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 2; 2023: 0; 2024: 0; 2025: 1; 2026: 1.

4 papers.