.png){kind=icon}
Return
The dynamic expectation-conditional maximization either' algorithm
.png){kind=icon}
OA
AI
DOI：10.1111/j.1467-9868.2011.01013.x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
. The expectationconditional maximization either (ECME) algorithm has proven to be an effective way of accelerating the expectationmaximization algorithm for many problems. Recognizing the limitation of using prefixed acceleration subspaces in the ECME algorithm, we propose a dynamic ECME (DECME) algorithm which allows the acceleration subspaces to be chosen dynamically. The simplest DECME implementation is what we call DECME-1, which uses the line that is determined by the two most recent estimates as the acceleration subspace. The investigation of DECME-1 leads to an efficient, simple, stable and widely applicable DECME implementation, which uses two-dimensional acceleration subspaces and is referred to as DECME-2. The fast convergence of DECME-2 is established by the theoretical result that, in a small neighbourhood of the maximum likelihood estimate, it is equivalent to a conjugate direction method. The remarkable accelerating effect of DECME-2 and its variant is also demonstrated with several numerical examples.
Keywords:
Conjugate direction
Expectation-conditional maximization algorithm
Expectation-conditional maximization either algorithm
Expectation-maximization algorithm
Square iterative methods
Successive over-relaxation
Journal
J
IF:
3.6
Papers:
1.5K
Citations:
3.2W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveTuning the water permeability of ultra-high molecular weight polyethylene microporous membrane by molecular self-assembly and flow field.png)
Polymer
PolymerIF0
PREAI
ShareSave
View more