SPORF
SPORF copied to clipboard
investigate ranger's binning strategy
let n be the number of samples, and m be the number of unique values per a given feature. then for that feature, we only need to search over min(n,m) splits.