Expectation-Maximisation for a mixture of exponential distributions
EM.mixexp.Rd
Experimental function for Expectation-Maximisation (EM) estimation
Details
The EM algorithm is very simple for exponential mixtures (as well as for many other mixture models).
According to a general feature of EM, this iterative method leads to successive estimates with increasing likelihood but which may converge to a local maximum of the likelihood.
Value
List with
- estimate
-
Estimated values as a named vector.
- logL
-
Vector giving the log-likelihood for successive iterations.
- Alpha
-
Matrix with
m
columns giving probability weights for successive iterations. Row with numberit
contains them
probabilities at iterationit
. - Theta
-
Matrix with
m
columns giving the estimates of them
expectations for the successive iterations
Note
The estimation is done for expectation (inverse rates) but the
estimate
vector in the result contains rates for compatibility
reasons (e.g with exponential).
See also
mom.mixexp2
and ini.mixexp2
for "cheap"
estimators when m = 2
.