RRerF (aka Randomer Forest (RerF) or Random Projection Forests) is an algorithm developed by Tomita (2016) <arXiv:1506.03410v2> which is similar to Random Forest  Random Combination (ForestRC) developed by Breiman (2001) <doi:10.1023/A:1010933404324>. Random Forests create axisparallel, or orthogonal trees. That is, the feature space is recursively split along directions parallel to the axes of the feature space. Thus, in cases in which the classes seem inseparable along any single dimension, Random Forests may be suboptimal. To address this, Breiman also proposed and characterized ForestRC, which uses linear combinations of coordinates rather than individual coordinates, to split along. This package, 'rerf', implements RerF which is similar to ForestRC. The difference between the two algorithms is where the random linear combinations occur: ForestRC combines features at the per tree level whereas RerF takes linear combinations of coordinates at every node in the tree.
Package details 


Author  Jesse Patsolic [ctb, cre], Benjamin Falk [ctb], Jaewon Chung [ctb], James Browne [aut], Tyler Tomita [aut], Joshua Vogelstein [ths] 
Maintainer  Jesse Patsolic <[email protected]> 
License  Apache License 2.0  file LICENSE 
Version  2.0.4 
URL  https://github.com/neurodata/RRerF 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.