The EM Algorithm and Extensions

By Geoffrey J. McLachlan, Thriyambakam Krishnan | Publisher: Wiley

About the book

The only single-source——now completely updated and revised——to offer a unified treatment of the theory, methodology, and applications of the EM algorithm

Complete with updates that capture developments from the past decade, The EM Algorithm and Extensions, Second Edition successfully provides a basic understanding of the EM algorithm by describing its inception, implementation, and applicability in numerous statistical contexts. In conjunction with the fundamentals of the topic, the authors discuss convergence issues and computation of standard errors, and, in addition, unveil many parallels and connections between the EM algorithm and Markov chain Monte Carlo algorithms. Thorough discussions on the complexities and drawbacks that arise from the basic EM algorithm, such as slow convergence and lack of an in-built procedure to compute the covariance matrix of parameter estimates, are also presented.

While the general philosophy of the First Edition has been maintained, this timely new edition has been updated, revised, and expanded to include:

  • New chapters on Monte Carlo versions of the EM algorithm and generalizations of the EM algorithm

  • New results on convergence, including convergence of the EM algorithm in constrained parameter spaces

  • Expanded discussion of standard error computation methods, such as methods for categorical data and methods based on numerical differentiation

  • Coverage of the interval EM, which locates all stationary points in a designated region of the parameter space

  • Exploration of the EM algorithm's relationship with the Gibbs sampler and other Markov chain Monte Carlo methods

  • Plentiful pedagogical elements—chapter introductions, lists of examples, author and subject indices, computer-drawn graphics, and a related Web site

The EM Algorithm and Extensions, Second Edition serves as an excellent text for graduate-level statistics students and is also a comprehensive resource for theoreticians, practitioners, and researchers in the social and physical sciences who would like to extend their knowledge of the EM algorithm.

Editions of The EM Algorithm and Extensions

Hardcover
ISBN 9780471201700
EBook
ISBN 9780470191606
EBook
ISBN 9780470191613

Read an Excerpt

The only single-source——now completely updated and revised——to offer a unified treatment of the theory, methodology, and applications of the EM algorithm

Complete with updates that capture developments from the past decade, The EM Algorithm and Extensions, Second Edition successfully provides a basic understanding of the EM algorithm by describing its inception, implementation, and applicability in numerous statistical contexts. In conjunction with the fundamentals of the topic, the authors discuss convergence issues and computation of standard errors, and, in addition, unveil many parallels and connections between the EM algorithm and Markov chain Monte Carlo algorithms. Thorough discussions on the complexities and drawbacks that arise from the basic EM algorithm, such as slow convergence and lack of an in-built procedure to compute the covariance matrix of parameter estimates, are also presented.

While the general philosophy of the First Edition has been maintained, this timely new edition has been updated, revised, and expanded to include:

  • New chapters on Monte Carlo versions of the EM algorithm and generalizations of the EM algorithm

  • New results on convergence, including convergence of the EM algorithm in constrained parameter spaces

  • Expanded discussion of standard error computation methods, such as methods for categorical data and methods based on numerical differentiation

  • Coverage of the interval EM, which locates all stationary points in a designated region of the parameter space

  • Exploration of the EM algorithm's relationship with the Gibbs sampler and other Markov chain Monte Carlo methods

  • Plentiful pedagogical elements—chapter introductions, lists of examples, author and subject indices, computer-drawn graphics, and a related Web site

The EM Algorithm and Extensions, Second Edition serves as an excellent text for graduate-level statistics students and is also a comprehensive resource for theoreticians, practitioners, and researchers in the social and physical sciences who would like to extend their knowledge of the EM algorithm.

Frequently Asked Questions

What is The EM Algorithm and Extensions about?

The only single-source——now completely updated and revised——to offer a unified treatment of the theory, methodology, and applications of the EM algorithm

Complete with updates that capture developments from the past decade, The EM Algorithm and Extensions, Second Edition successfully provides a basic understanding of the EM algorithm by describing its inception, implementation, and applicability in numerous statistical contexts. In conjunction with the fundamentals of the topic, the authors discuss convergence issues and computation of standard errors, and, in addition, unveil many parallels and connections between the EM algorithm and Markov chain Monte Carlo algorithms. Thorough discussions on the complexities and drawbacks that arise from the basic EM algorithm, such as slow convergence and lack of an in-built procedure to compute the covariance matrix of parameter estimates, are also presented.

While the general philosophy of the First Edition has been maintained, this timely new edition has been updated, revised, and expanded to include:

  • New chapters on Monte Carlo versions of the EM algorithm and generalizations of the EM algorithm

  • New results on convergence, including convergence of the EM algorithm in constrained parameter spaces

  • Expanded discussion of standard error computation methods, such as methods for categorical data and methods based on numerical differentiation

  • Coverage of the interval EM, which locates all stationary points in a designated region of the parameter space

  • Exploration of the EM algorithm's relationship with the Gibbs sampler and other Markov chain Monte Carlo methods

  • Plentiful pedagogical elements—chapter introductions, lists of examples, author and subject indices, computer-drawn graphics, and a related Web site

The EM Algorithm and Extensions, Second Edition serves as an excellent text for graduate-level statistics students and is also a comprehensive resource for theoreticians, practitioners, and researchers in the social and physical sciences who would like to extend their knowledge of the EM algorithm.

What core themes, tropes, or subjects are explored in The EM Algorithm and Extensions?

Mathematics and Science > Mathematics > Probability and statistics

Where can I read a sample of The EM Algorithm and Extensions?

You can read an official preview of the few pages here https://www.book2look.com/book/9780471201700

Is The EM Algorithm and Extensions part of a series, and can it be read as a standalone?

Yes it is a part of series Wiley Series in Probability and Statistics

Who is/are the Author/s of the book The EM Algorithm and Extensions?

Geoffrey J. McLachlan, Thriyambakam Krishnan

Who is the Publisher of the book The EM Algorithm and Extensions?

Wiley

What are the ISBN numbers for the physical and digital editions?

The EM Algorithm and Extensions is available as hardcover(ISBN 9780471201700) and ebook(ISBN 9780470191606) and ebook(ISBN 9780470191613)

Where can I buy The EM Algorithm and Extensions online or support local independent bookshops?

You can buy The EM Algorithm and Extensions from below

Where can I buy The EM Algorithm and Extensions?