-
-
Notifications
You must be signed in to change notification settings - Fork 256
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
Linear decision trees improvements #60
Conversation
…from decision trees
…from decision trees
I have exams this week and next but I'm interested in helping out with this afterward. There are only a few changes left mentioned in the previous PR. |
* use toy test from sklearn * use four perfectly separable uniform blobs
This hyper-parameter can be estimated from the input data and is therefore uneccessary in the API.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Tests & lints want a review?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Test & lints want an approval?
For looking at random forests (which I think should be in a separate PR to these improvements) we can either:
|
they were moved to #66 |
Codecov Report
@@ Coverage Diff @@
## master #60 +/- ##
=========================================
- Coverage 9.97% 9.40% -0.57%
=========================================
Files 47 49 +2
Lines 2507 2657 +150
=========================================
Hits 250 250
- Misses 2257 2407 +150
Continue to review full report at Codecov.
|
* introduce node iterator * rewrite `max_depth`, `num_leaves`, `features` in iterator syntax
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Happy to merge this then continue on with RFs in that other PR
awesome 👍 I will just write a quick function which can generates a tikz styled tree (for example here) and then merge |
Nice work! That looks great. One of the more premium features in ML libraries for sure. |
This PR continues the work of #43
linfa-trees
linfa-trees