Displaying similar documents to “On EM algorithms and their proximal generalizations”

The EM algorithm and its implementation for the estimation of frequencies of SNP-haplotypes

Joanna Polańska (2003)

International Journal of Applied Mathematics and Computer Science

Similarity:

A haplotype analysis is becoming increasingly important in studying complex genetic diseases. Various algorithms and specialized computer software have been developed to statistically estimate haplotype frequencies from marker phenotypes in unrelated individuals. However, currently there are very few empirical reports on the performance of the methods for the recovery of haplotype frequencies. One of the most widely used methods of haplotype reconstruction is the Maximum Likelihood method,...

Coupling a stochastic approximation version of EM with an MCMC procedure

Estelle Kuhn, Marc Lavielle (2004)

ESAIM: Probability and Statistics

Similarity:

The stochastic approximation version of EM (SAEM) proposed by Delyon et al. (1999) is a powerful alternative to EM when the E-step is intractable. Convergence of SAEM toward a maximum of the observed likelihood is established when the unobserved data are simulated at each iteration under the conditional distribution. We show that this very restrictive assumption can be weakened. Indeed, the results of Benveniste et al. for stochastic approximation with markovian perturbations are used...

An application of the expectation-maximization algorithm to interference rejection for direct-sequence spread-spectrum signals

Quan G. Zhang, Costas N. Georghiades (1999)

Kybernetika

Similarity:

For a direct-sequence spread-spectrum (DS-SS) system we pose and solve the problem of maximum-likelihood (ML) sequence estimation in the presence of narrowband interference, using the expectation-maximization (EM) algorithm. It is seen that the iterative EM algorithm obtains at each iteration an estimate of the interference which is then subtracted from the data before a new sequence estimate is produced. Both uncoded and trellis coded systems are studied, and the EM-based algorithm...

Em Algorithm for MLE of a Probit Model for Multiple Ordinal Outcomes

Grigorova, Denitsa, Encheva, Elitsa, Gueorguieva, Ralitza (2013)

Serdica Journal of Computing

Similarity:

The correlated probit model is frequently used for multiple ordered data since it allows to incorporate seamlessly different correlation structures. The estimation of the probit model parameters based on direct maximization of the limited information maximum likelihood is a numerically intensive procedure. We propose an extension of the EM algorithm for obtaining maximum likelihood estimates for a correlated probit model for multiple ordinal outcomes. The algorithm is implemented in...

Fuzzy clustering of spatial binary data

Mô Dang, Gérard Govaert (1998)

Kybernetika

Similarity:

An iterative fuzzy clustering method is proposed to partition a set of multivariate binary observation vectors located at neighboring geographic sites. The method described here applies in a binary setup a recently proposed algorithm, called Neighborhood EM, which seeks a partition that is both well clustered in the feature space and spatially regular [AmbroiseNEM1996]. This approach is derived from the EM algorithm applied to mixture models [Dempster1977], viewed as an alternate optimization...