Skip to content

Commit

Permalink
Release
Browse files Browse the repository at this point in the history
  • Loading branch information
cerlymarco committed Aug 31, 2021
1 parent a2cbfb4 commit 02beefd
Showing 1 changed file with 4 additions and 4 deletions.
8 changes: 4 additions & 4 deletions notebooks/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -706,6 +706,7 @@ class lineartree.LinearBoostClassifier(base_estimator, loss = 'hamming', n_estim
- If "sqrt", then `max_features=sqrt(n_features)`.
- If "log2", then `max_features=log2(n_features)`.
- If None, then `max_features=n_features`.

Note: the search for a split does not stop until at least one valid partition of the node samples is found, even if it requires to effectively inspect more than ``max_features`` features.

- ```max_leaf_nodes : int, default=None```
Expand Down Expand Up @@ -851,10 +852,9 @@ class lineartree.LinearForestRegressor(base_estimator, *, n_estimators=100, max_
- If "auto", then `max_features=n_features`.
- If "sqrt", then `max_features=sqrt(n_features)`.
- If "log2", then `max_features=log2(n_features)`.
- If None, then `max_features=n_features`.
Note: the search for a split does not stop until at least one
valid partition of the node samples is found, even if it requires to
effectively inspect more than ``max_features`` features.
- If None, then `max_features=n_features`

Note: the search for a split does not stop until at least one valid partition of the node samples is found, even if it requires to effectively inspect more than ``max_features`` features.

- ```max_leaf_nodes : int, default=None```

Expand Down

0 comments on commit 02beefd

Please sign in to comment.