On computing the largest fraction of missing information for the EM algorithm and the worst linear function for data augmentation.
type: Item
instance of: scholarly article
title: On computing the largest fraction of missing information for the EM algorithm and the worst linear function for data augmentation.
zbMATH Open document ID: 1063.62507
DOI: 10.1016/S0167-9473(99)00003-1
author: Chris Fraley
published in: Computational Statistics and Data Analysis
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 62-07
Mathematics Subject Classification ID: 65C60
Mathematics Subject Classification ID: 62F10
zbMATH DE Number: 1387387
zbMATH Keywords: EM algorithm
zbMATH Keywords: Data augmentation
zbMATH Keywords: Iterative simulation
zbMATH Keywords: MCMC
zbMATH Keywords: Missing data
describes a project that uses: LAPACK
MaRDI profile type: Publication
cites work: Q4746656
cites work: Q4139463
cites work: Q4864274
cites work: Q5689624
cites work: Q4003880
cites work: Q3995613
cites work: Efficient Derivative Codes through Automatic Differentiation and Interface Contraction: An Application in Biostatistics
cites work: Imputation using markov chains
cites work: Q3816821
cites work: Q4353852
cites work: On the global and componentwise rates of convergence of the EM algorithm
cites work: Q5652137
cites work: Q5514782
cites work: Q4654005
cites work: Multiple Imputation After 18+ Years
cites work: Q4246485
cites work: Tools for statistical inference. Methods for the exploration of posterior distributions and likelihood functions.
cites work: The Calculation of Posterior Distributions by Data Augmentation
cites work: Q5674306
cites work: On the convergence properties of the EM algorithm
full work available at URL: s0167-9473(99)00003-1
OpenAlex ID: W1971428601
description: scientific article; zbMATH DE number 1387387