Search icon CANCEL
Subscription
0
Cart icon
Cart
Close icon
You have no products in your basket yet
Save more on your purchases!
Savings automatically calculated. No voucher code required
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletters
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Mastering Probabilistic Graphical Models with Python

You're reading from  Mastering Probabilistic Graphical Models with Python

Product type Book
Published in Aug 2015
Publisher
ISBN-13 9781784394684
Pages 284 pages
Edition 1st Edition
Languages
Author (1):
Ankur Ankan Ankur Ankan
Profile icon Ankur Ankan
Toc

Table of Contents (14) Chapters close

Mastering Probabilistic Graphical Models Using Python
Credits
About the Authors
About the Reviewers
www.PacktPub.com
Preface
1. Bayesian Network Fundamentals 2. Markov Network Fundamentals 3. Inference – Asking Questions to Models 4. Approximate Inference 5. Model Learning – Parameter Estimation in Bayesian Networks 6. Model Learning – Parameter Estimation in Markov Networks 7. Specialized Models Index

Importance sampling in Bayesian networks


In this section, we will apply the concept of importance sampling in Bayesian networks. We will discuss the proposal distribution Q, which we usually use in the case of Bayesian networks.

Assume that in a Bayesian network, we want to focus our samples to a particular set of events Z = z, either because we want the probability of Z or we have observed Z. Taking the example of our restaurant model, let's say we have observed that the cost is high. It is easy for us to sample the descendant variables of Cost according to this condition. However, it is not possible for us to sample the nondescendant variables without performing inference over them.

So now, we define a distribution that simplifies the generation of particles. This new distribution is known as mutilated network proposal distribution. Let's say, given a network B and some conditions Z = z, we define the mutilated network as follows:

  • Each node has no parents in , and the CPDs of all give...
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $15.99/month. Cancel anytime