Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme (Q5941373)
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: Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme |
scientific article; zbMATH DE number 1635561
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme |
scientific article; zbMATH DE number 1635561 |
Statements
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme (English)
0 references
20 August 2001
0 references
on-line prediction
0 references
pruning
0 references
decision tree
0 references
expert model
0 references
aggregating algorithm
0 references
0 references
0.8500847220420837
0 references
0.7815321087837219
0 references
0.7815321087837219
0 references
