Efficient algorithms for minimax decisions under tree-structured incompleteness (Q2297785)
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: Efficient algorithms for minimax decisions under tree-structured incompleteness |
scientific article; zbMATH DE number 7170145
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for minimax decisions under tree-structured incompleteness |
scientific article; zbMATH DE number 7170145 |
Statements
Efficient algorithms for minimax decisions under tree-structured incompleteness (English)
0 references
20 February 2020
0 references
coarse data
0 references
incomplete observations
0 references
minimax decision making
0 references
maximum entropy
0 references
0.7202123999595642
0 references
0.7020643949508667
0 references
0.7001802921295166
0 references
0.6996697187423706
0 references
0.6995376348495483
0 references
