Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.
Sign upExtremely randomised trees in caret using ranger #581
Comments
|
My thought is that we should have a different method and update |
|
Perfect; I think what you suggested is very reasonable. |
|
I'm coding this up but it looks like it might need to wait until the next release. Now that I've looked into it, I will just make |
|
No problem; thank you for following this up. |
|
I'll try to put this together for the imminent CRAN release since the CRAN ranger is at 0.8.0. |
|
I decided to incorporate the splitting rule into the basic ranger model. With regular grid search, it will try to usual splitting rule and the randomized trees. That is also included in random search too. |
|
Give it a spin and let me know if there are any issues. |
|
Thank you for this! I agree, having Unfortunately, no spin out of the box because of the |
|
Feel free to close this issue. It seems sorted. |
Hello,
Since version
0.6.4the packagerangersupports Extremely randomised trees. Strictly-speaking the only "new thing" would be to actually change the argumentsplitrule = "extratrees", nevertheless I have the feeling that people would miss out using extr. random trees if they are not careful. There is a package, which is included incaretalready,extraTreesthat implements the same algorithm. That implementation though does not do multi-core computation out-of-the-box (and its code-base hasn't change in the last 2 years either, which worries me too) so I think there is a case to userangerdirectly.Should one:
rangerExtremeso users can directly invoke extremely randomise trees?Let me note that
0.6.4is not available on CRAN, so you might want to nap the issue of adding the e.r.t. functionality until it is included in the CRAN release?All best,
Pantelis