Prediction of the EM-Algorithm Speed of Convergence with Cramer-Rao Bounds

2007 ◽  
Author(s):  
Cedric Herzet ◽  
Luc Vandendorpe
Keyword(s):  
Em Algorithm ◽  
Speed Of Convergence ◽  
The Em Algorithm

Multi-User Detection Analysis via Aitken-δ2 EM Acceleration Algorithm

2011 ◽  
Vol 225-226 ◽  
pp. 284-288
Author(s):  
Jin Long Xian ◽  
Jian Wu Li
Keyword(s):  
Missing Data ◽  
Em Algorithm ◽  
Iterative Algorithm ◽  
Convergence Speed ◽  
Speed Of Convergence ◽  
Detection Analysis ◽  
The Em Algorithm ◽  
Aitken Method

The EM iterative algorithm is commonly used in recent years for missing data, which has the character of easy and popular applicability. But the EM algorithm has a fatal weakness that the convergence speed is slowly; Acceleration of the EM algorithm using the Aitken method is proposed in order to solve this problem.In Multi-user Detection, via this accelerated algorithm, we get a good performance which trends to ML performance, and compared its speed of convergence with the EM algorithm that Aitken-acceleration algorithm has faster convergence than the standard EM algorithm, and we also illustrate the performance of simulation.

EM Acceleration Algorithm Using the Vector-ε Apply in Multi-User Detection

2011 ◽  
Vol 225-226 ◽  
pp. 280-283
Author(s):  
Jin Long Xian ◽  
Jian Wu Li
Keyword(s):  
Missing Data ◽  
Maximum Likelihood ◽  
Em Algorithm ◽  
Iterative Algorithm ◽  
Computational Efficiency ◽  
Convergence Speed ◽  
Speed Of Convergence ◽  
The Em Algorithm

The EM iterative algorithm is a very general and popular algorithm that commonly used for missing data to find maximum likelihood in recent years, which has the character of stability,flexibility and simlicity.However, the EM algorithm has a great weakness that the convergence speed is slowly; Acceleration of the EM algorithm using the Vector-ε method is proposed in order to solve this problem in this paper.In Multi-user Detection, via this accelerated algorithm, we get a good performance which trends to ML performance and improving the computational efficiency, and compared its speed of convergence with the EM algorithm that Vector-ε acceleration algorithm has faster convergence than the standard EM algorithm.

scholarly journals A CramÉr-Rao Bound Characterization of the EM-Algorithm Mean Speed of Convergence

2008 ◽  
Vol 56 (6) ◽  
pp. 2218-2228 ◽  
Author(s):  
CÉdric Herzet ◽  
ValÉry Ramon ◽  
Alexandre Renaux ◽  
Luc Vandendorpe
Keyword(s):  
Em Algorithm ◽  
Speed Of Convergence ◽  
The Em Algorithm ◽  
Cramer Rao Bound

EM Algorithm Based on Fuzzification and its Application

2012 ◽  
Vol 532-533 ◽  
pp. 1445-1449
Author(s):  
Ting Ting Tong ◽  
Zhen Hua Wu
Keyword(s):  
Em Algorithm ◽  
Mixed Model ◽  
Image Data ◽  
Training Sample ◽  
Model Parameters ◽  
Parameter Learning ◽  
Weighted Degree ◽  
The Em Algorithm ◽  
The Impact

EM algorithm is a common method to solve mixed model parameters in statistical classification of remote sensing image. The EM algorithm based on fuzzification is presented in this paper to use a fuzzy set to represent each training sample. Via the weighted degree of membership, different samples will be of different effect during iteration to decrease the impact of noise on parameter learning and to increase the convergence rate of algorithm. The function and accuracy of classification of image data can be completed preferably.

scholarly journals PENDUGAAN DATA HILANG DENGAN METODE YATES DAN ALGORITMA EM PADA RANCANGAN LATTICE SEIMBANG

2015 ◽  
Vol 4 (2) ◽  
pp. 74
Author(s):  
MADE SUSILAWATI ◽  
KARTIKA SARI
Keyword(s):  
Missing Data ◽  
Em Algorithm ◽  
Basic Concept ◽  
Incomplete Data ◽  
Likelihood Function ◽  
Animal Husbandry ◽  
Lattice Design ◽  
The Em Algorithm ◽  
Missing Data Estimation ◽  
Data Estimation

Missing data often occur in agriculture and animal husbandry experiment. The missing data in experimental design makes the information that we get less complete. In this research, the missing data was estimated with Yates method and Expectation Maximization (EM) algorithm. The basic concept of the Yates method is to minimize sum square error (JKG), meanwhile the basic concept of the EM algorithm is to maximize the likelihood function. This research applied Balanced Lattice Design with 9 treatments, 4 replications and 3 group of each repetition. Missing data estimation results showed that the Yates method was better used for two of missing data in the position on a treatment, a column and random, meanwhile the EM algorithm was better used to estimate one of missing data and two of missing data in the position of a group and a replication. The comparison of the result JKG of ANOVA showed that JKG of incomplete data larger than JKG of incomplete data that has been added with estimator of data. This suggest  thatwe need to estimate the missing data.

Sign in / Sign up

Export Citation Format

Share Document