Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Mastering Probabilistic Graphical Models with Python
  • Table Of Contents Toc
Mastering Probabilistic Graphical Models with Python

Mastering Probabilistic Graphical Models with Python

By : Ankan
3.3 (7)
close
close
Mastering Probabilistic Graphical Models with Python

Mastering Probabilistic Graphical Models with Python

3.3 (7)
By: Ankan

Overview of this book

Probabilistic Graphical Models is a technique in machine learning that uses the concepts of graph theory to compactly represent and optimally predict values in our data problems. In real world problems, it's often difficult to select the appropriate graphical model as well as the appropriate inference algorithm, which can make a huge difference in computation time and accuracy. Thus, it is crucial to know the working details of these algorithms. This book starts with the basics of probability theory and graph theory, then goes on to discuss various models and inference algorithms. All the different types of models are discussed along with code examples to create and modify them, and also to run different inference algorithms on them. There is a complete chapter devoted to the most widely used networks Naive Bayes Model and Hidden Markov Models (HMMs). These models have been thoroughly discussed using real-world examples.
Table of Contents (9 chapters)
close
close
8
Index

MAP using variable elimination

Let's start with a very basic example of a network A -> B, as shown in the following figure:

MAP using variable elimination

Fig 3.13: Basic Bayesian network with two variables

For MAP, we want to compute the following:

MAP using variable elimination

If we consider any particular assignment a for the variable A, we have the following:

MAP using variable elimination

So, for any given assignment of A, we have to select the assignment of B for which P(b|a) is at maximum. We also have to select the maximum assignment of B as any given assignment of A doesn't guarantee that it would be the global maximum. Therefore, we need to check the values for each assignment of A.

Now, let's try to find the MAP assignment for the network in the Fig 3.13. Assuming the assignment from A to MAP using variable elimination, let's define MAP using variable elimination MAP using variable elimination and similarly, MAP using variable elimination. Now, let's compute the max-marginal over A:

MAP using variable elimination
CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
Mastering Probabilistic Graphical Models with Python
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon