Probabilistic graphical models (PGMs) are a rich framework for encoding probability distributions over complex domains: joint (multivariate) distributions over large numbers of random variables that interact with each other. These representations sit at the intersection of statistics and computer science, relying on concepts from probability theory, graph algorithms, machine learning, and more. They are the basis for the state-of-the-art methods in a wide variety of applications, such as medical diagnosis, image understanding, speech recognition, natural language processing, and many, many more. They are also a foundational tool in formulating many machine learning problems.
This course is part of the Probabilistic Graphical Models Specialization
Offered By
About this Course
Skills you will gain
- Algorithms
- Expectation–Maximization (EM) Algorithm
- Graphical Model
- Markov Random Field
Offered by
Syllabus - What you will learn from this course
Learning: Overview
Review of Machine Learning Concepts from Prof. Andrew Ng's Machine Learning Class (Optional)
Parameter Estimation in Bayesian Networks
Learning Undirected Models
Learning BN Structure
Learning BNs with Incomplete Data
Reviews
- 5 stars71.38%
- 4 stars19.52%
- 3 stars5.38%
- 2 stars3.03%
- 1 star0.67%
TOP REVIEWS FROM PROBABILISTIC GRAPHICAL MODELS 3: LEARNING
Tougher course than the 2 preceding ones, but definitely worthwhile.
Awesome course... builds intuitive thinking for developing intelligent algorithms...
very good course for PGM learning and concept for machine learning programming. Just some description for quiz of final exam is somehow unclear, which lead to a little bit confusing.
Plz give practical assignments in Python. Matlab is not free and not many and neither myself know Matlab.
About the Probabilistic Graphical Models Specialization

Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
Learning Outcomes: By the end of this course, you will be able to
More questions? Visit the Learner Help Center.