Skip to main content

EM Algorithm with PIP Initialization and Temperature-Based Selection

  • Conference paper
  • 3335 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5179))

Abstract

The EM algorithm is an efficient algorithm to obtain the ML estimate for incomplete data, but has the local optimality problem. The deterministic annealing EM (DAEM) algorithm was once proposed to solve this problem, which begins a search from the primitive initial point (PIP). Then, proposed was the mes-EM algorithm, which runs the EM repeatedly in many various directions from the PIP, and achieves good solution quality with high computing cost. This paper proposes a variant of the mes-EM, called mes-EM(β), which uses the temperature to select a small promising portion of the mes-EM runs. Our experiments for the Gaussian mixture estimation showed the proposed algorithm was much faster than the original mes-EM without degrading its solution quality.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum-likelihood from incomplete data via the EM algorithm. J. Royal Statist. Soc. Ser. B 39, 1–38 (1977)

    MATH  MathSciNet  Google Scholar 

  2. McLachlan, G.J., Krishnan, T.: The EM Algorithm and Extensions. John Wiley & Sons, Chichester (1997)

    MATH  Google Scholar 

  3. McLachlan, G.J., Peel, D.: Finite Mixture Models. John Wiley & Sons, Chichester (2000)

    MATH  Google Scholar 

  4. Ueda, N., Nakano, R.: Deterministic annealing EM algorithm. Neural Networks 11, 271 (1998)

    Article  Google Scholar 

  5. Ishikawa, Y., Nakano, R.: Landscape of a Likelihood Surface for a Gaussian Mixture and its Use for the EM Algorithm. In: Proc. Int. Joint Conf. on Neural Networks (IJCNN 2006), pp. 2413–2419 (2006)

    Google Scholar 

  6. Takada, M., Nakano, R.: Threshold-based dynamic annealing for multi-thread DAEM and its extreme. In: Proc. Int. Joint Conf. on Neural Networks (IJCNN 2003), pp. 501–506 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ignac Lovrek Robert J. Howlett Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ishikawa, Y., Nakano, R. (2008). EM Algorithm with PIP Initialization and Temperature-Based Selection. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2008. Lecture Notes in Computer Science(), vol 5179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85567-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85567-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85566-8

  • Online ISBN: 978-3-540-85567-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics