A note on computing the asymptotic form of a limited sequence of decision trees (Q1070834)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3938589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on computing the asymptotic form of a limited sequence of decision trees |
scientific article; zbMATH DE number 3938589 |
Statements
A note on computing the asymptotic form of a limited sequence of decision trees (English)
0 references
1982
0 references
multistage decision processes
0 references
learning strategy
0 references
quasi-optimizier
0 references
algorithm
0 references
asymptotic decision tree
0 references
breadth-first order
0 references
0.7159289717674255
0 references
0.694602370262146
0 references
0.6912223696708679
0 references
0.6871702671051025
0 references
0.6843323111534119
0 references
