Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Claim 2.2 hsRF achieves maximum performance with fewer trees than RF (5 times fewer trees) #9

Open
do8572 opened this issue Dec 24, 2022 · 0 comments
Assignees

Comments

@do8572
Copy link
Owner

do8572 commented Dec 24, 2022

2.2 hsRF achieves maximum performance with fewer trees than RF (5 times fewer trees)

Moreover, hsRF tends to achieve its maximum performance with fewer trees than RF without regularization; as a consequence, RF with HS is of-ten able to achieve the same performance with an ensemble that is five times smaller, allowing us to achieve large sav-ings in computational resources.

@do8572 do8572 changed the title Claim 2.2 Claim 2.2 hsRF achieves maximum performance with fewer trees than RF (5 times fewer trees) Dec 24, 2022
@do8572 do8572 self-assigned this Dec 25, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant