Skip to main content

Finite Mixture MLE and EM Algorithm

  • Chapter
  • First Online:
Statistical Inference Under Mixture Models

Part of the book series: ICSA Book Series in Statistics ((ICSABSS))

  • 205 Accesses

Abstract

The latent structure inherent in mixture models offers a fitting scenario for the renowned EM algorithm. In Chap. 7, we begin by offering a general overview and then get into comprehensive explanations of the EM algorithm’s application in computing the maximum likelihood estimate for finite mixture models. This chapter also addresses the critical matter of algorithm convergence, taking into consideration the global convergence theorem. Additionally, it provides specific insights into the workings of the EM algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Chen, J., and J. D. Kalbfleisch. 1996. Penalized minimum-distance estimates in finite mixture models. Canadian Journal of Statistics 24 (2): 167–175.

    Article  MathSciNet  MATH  Google Scholar 

  • Harrison, G. W., and P. H. Millard. 1991b. Balancing acute and long-term care: The mathematics of throughput in departments of geriatric medicine. Methods of Information in Medicine 30 (03): 221–228.

    Article  Google Scholar 

  • Kalbfleisch, J. G. 1985. Probability and Statistical Inference: Probability, vol. 1. Chem: Springer Science & Business Media.

    Google Scholar 

  • Leroux, B. G. 1992b. Maximum-likelihood estimation for hidden markov models. Stochastic Processes and Their Applications 40 (1): 127–143.

    Article  MathSciNet  MATH  Google Scholar 

  • McLachlan, G., and D. Peel. 2000. Finite Mixture Models. Hoboken: Wiley.

    Book  MATH  Google Scholar 

  • McLachlan, G. J., and T. Krishnan. 2007. The EM Algorithm and Extensions. Hoboken: Wiley.

    MATH  Google Scholar 

  • Wu, C. J. 1983. On the convergence properties of the em algorithm. The Annals of statistics 11: 95–103.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2023 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Chen, J. (2023). Finite Mixture MLE and EM Algorithm. In: Statistical Inference Under Mixture Models. ICSA Book Series in Statistics. Springer, Singapore. https://doi.org/10.1007/978-981-99-6141-2_7

Download citation

Publish with us

Policies and ethics