Skip to content
/ SPORF Public
forked from neurodata/SPORF

This is the implementation of Sparse Projection Oblique Randomer Forest

Notifications You must be signed in to change notification settings

amueller/SPORF

 
 

Repository files navigation

arXiv shield PyPI version CRAN Status Badge DOI dockerhub Downloads shield

RerF (aka Randomer Forest or Random Projection Forests) is an algorithm developed by Tomita et al. (2016) which is similar to Random Forest-Random Combination (Forest-RC) developed by Breiman (2001).

The difference between the two algorithms is where the random linear combinations occur: Forest-RC combines features at the tree level whereas RerF combines features at the node level.

Packages

  • Memory optimized C++ implementation of RandomForest and RerF.
  • Python bindings to packedForest.
  • The R and C++ implemetation of RerF.

About

This is the implementation of Sparse Projection Oblique Randomer Forest

Resources

Stars

Watchers

Forks

Packages

 
 
 

Languages

  • C++ 62.4%
  • R 27.5%
  • Python 8.4%
  • Makefile 0.8%
  • Dockerfile 0.4%
  • Shell 0.2%
  • Other 0.3%