On computing the largest fraction of missing information for the EM algorithm and the worst linear function for data augmentation. (Q1960468)
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 1387387
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computing the largest fraction of missing information for the EM algorithm and the worst linear function for data augmentation. |
scientific article; zbMATH DE number 1387387 |
Statements
On computing the largest fraction of missing information for the EM algorithm and the worst linear function for data augmentation. (English)
0 references
12 January 2000
0 references
EM algorithm
0 references
Data augmentation
0 references
Iterative simulation
0 references
MCMC
0 references
Missing data
0 references
0 references
0.7710031867027283
0 references
0.7710031867027283
0 references
