Open
Description
currently oblique forests just try to make one linear combination of predictors, and they will try again (with different predictors) if that split isn't good enough.
There should be more flexibility with this. What if I want to try 5 different linear combos and pick the best one?
This would change some of the core C++ routines in splitting data.
Metadata
Metadata
Assignees
Labels
No labels