Advanced Markov Chain Monte Carlo Methods Learning from Past Samples

Afbeeldingen

Artikel vergelijken

  • Engels
  • Hardcover
  • 9780470748268
  • 16 juli 2010
  • 378 pagina's
Alle productspecificaties

Samenvatting

* Presents the latest developments in Monte Carlo research. * Provides a toolkit for simulating complex systems using MCMC. * Introduces a wide range of algorithms including Gibbs sampler, Metropolis-Hastings and an overview of sequential Monte Carlo algorithms.

Markov Chain Monte Carlo (MCMC) methods are now an indispensable tool in scientific computing. This book discusses recent developments of MCMC methods with an emphasis on those making use of past sample information during simulations. The application examples are drawn from diverse fields such as bioinformatics, machine learning, social science, combinatorial optimization, and computational physics.

Key Features:

  • Expanded coverage of the stochastic approximation Monte Carlo and dynamic weighting algorithms that are essentially immune to local trap problems.
  • A detailed discussion of the Monte Carlo Metropolis-Hastings algorithm that can be used for sampling from distributions with intractable normalizing constants.
  • Up-to-date accounts of recent developments of the Gibbs sampler.
  • Comprehensive overviews of the population-based MCMC algorithms and the MCMC algorithms with adaptive proposals.
  • Accompanied by a supporting website featuring datasets used in the book, along with codes used for some simulation examples.

This book can be used as a textbook or a reference book for a one-semester graduate course in statistics, computational biology, engineering, and computer sciences. Applied or theoretical researchers will also find this book beneficial.



Markov Chain Monte Carlo (MCMC) methods are now an indispensable tool in scientific computing. This book discusses recent developments of MCMC methods with an emphasis on those making use of past sample information during simulations. The application examples are drawn from diverse fields such as bioinformatics, machine learning, social science, combinatorial optimization, and computational physics.

Key Features:

  • Expanded coverage of the stochastic approximation Monte Carlo and dynamic weighting algorithms that are essentially immune to local trap problems.
  • A detailed discussion of the Monte Carlo Metropolis-Hastings algorithm that can be used for sampling from distributions with intractable normalizing constants.
  • Up-to-date accounts of recent developments of the Gibbs sampler.
  • Comprehensive overviews of the population-based MCMC algorithms and the MCMC algorithms with adaptive proposals.

This book can be used as a textbook or a reference book for a one-semester graduate course in statistics, computational biology, engineering, and computer sciences. Applied or theoretical researchers will also find this book beneficial.

Productspecificaties

Inhoud

Taal
en
Bindwijze
Hardcover
Oorspronkelijke releasedatum
16 juli 2010
Aantal pagina's
378
Illustraties
Nee

Betrokkenen

Hoofdauteur
Faming Liang
Tweede Auteur
Chuanhai Liu
Co Auteur
Raymond Carroll
Hoofduitgeverij
Wiley-Blackwell

Overige kenmerken

Extra groot lettertype
Nee
Product breedte
160 mm
Product hoogte
28 mm
Product lengte
234 mm
Studieboek
Nee
Verpakking breedte
160 mm
Verpakking hoogte
28 mm
Verpakking lengte
234 mm
Verpakkingsgewicht
692 g

EAN

EAN
9780470748268

Je vindt dit artikel in

Beschikbaarheid
Leverbaar
Boek, ebook of luisterboek?
Boek
Taal
Engels
Studieboek of algemeen
Algemene boeken
Nog geen reviews

Kies gewenste uitvoering

Prijsinformatie en bestellen

De prijs van dit product is 108 euro en 99 cent.
2 - 3 weken
Verkoop door bol
  • Prijs inclusief verzendkosten, verstuurd door bol
  • Ophalen bij een bol afhaalpunt mogelijk
  • 30 dagen bedenktijd en gratis retourneren
  • Dag en nacht klantenservice