Degang ZHU

117108

Estimating the parameters of hidden binomial trials by the EM algorithm

Estimating the parameters of hidden binomial trials by the EM algorithm

The EM algorithm has become a popular efficient iterative procedure to compute the maximum likelihood (ML) estimate in the presence of incomplete data. Each iteration of the EM algorithm involves two steps called expectation step (E-step) and maximization step (M-step). Complexity of statistical model usually makes the iteration of maximization step difficult. An identity on which the derivation of the EM algorithm is based is presented. It is showed that deriving iteration formula of parameter of hidden binomial trials based on the identity is much simpler than that in common M-step. 
Keywords:

Maximum likelihood, EM algorithm, incomplete data, hidden binomial trials identity,

PDF

___

  • . . .
Hacettepe Journal of Mathematics and Statistics-Cover
  • Yayın Aralığı: 6
  • Başlangıç: 2002
  • Yayıncı: Hacettepe Üniversitesi Fen Fakultesi
Arşiv
Sayıdaki Diğer Makaleler

On operators of Ap and A*p class

R ESKANDARİ, F. MİRZAPOUR, H. RAHMATAN

Enrique CALDERÍN-OJEDA, Emilio GÓMEZ-DÉNİZ

Second Cohomology of the Modular Lie Superalgebra Ω

Xiaoning XU, Xiaojun Lİ

On operators of Ap and A∗ p class

R. ESKANDARİ, F. MİRZAPOUR, H. RAHMATAN

R. ESKANDARİ, F. MİRZAPOUR, H. RAHMATAN

Mark FARAG

Estimating the parameters of hidden binomial trials by the EM algorithm

Degang ZHU

Countably mesocompact spaces and function insertion

Pengfei YAN, Qiuli WANG

Generalized Chebyshev polynomials

Clemente CESARANO

Durmuş ALBAYRAK, Sunil Dutt PUROHİT, Faruk UÇAR