A branch \& bound algorithm to determine optimal cross-splits for decision tree induction (Q2188762)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch \& bound algorithm to determine optimal cross-splits for decision tree induction |
scientific article; zbMATH DE number 7211575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch \& bound algorithm to determine optimal cross-splits for decision tree induction |
scientific article; zbMATH DE number 7211575 |
Statements
A branch \& bound algorithm to determine optimal cross-splits for decision tree induction (English)
0 references
11 June 2020
0 references
branch and bound
0 references
decision trees
0 references
classification
0 references
cross-splits
0 references
0.7625764012336731
0 references
0.7498494982719421
0 references
0.7356173992156982
0 references
0.733018696308136
0 references
0.7296395301818848
0 references
