Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm
Summary A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone ...
Explore 161 academic publications
Summary A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone ...
Purpose The purpose of this paper is to provide a comprehensive, yet concise, overview of the considerations and metrics required for partial least squares structural equation m...
The Gibbs sampler, the algorithm of Metropolis and similar iterative simulation methods are potentially very helpful for summarizing multivariate distributions. Used naively, ho...
Two extended basis sets (termed 5–31G and 6–31G) consisting of atomic orbitals expressed as fixed linear combinations of Gaussian functions are presented for the first row atoms...
We give a basic introduction to Gaussian Process regression models. We focus on understanding the role of the stochastic process and how it is used to define a distribution over...
An extended basis set of atomic functions expressed as fixed linear combinations of Gaussian functions is presented for hydrogen and the first-row atoms carbon to fluorine. In t...
WMAP precision data enables accurate testing of cosmological models. We find that the emerging standard model of cosmology, a flat Λ−dominated universe seeded by a nearly scalei...
Most current speech recognition systems use hidden Markov models (HMMs) to deal with the temporal variability of speech and Gaussian mixture models (GMMs) to determine how well ...