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.
Offert par
Spécialisation Modèles graphiques probabilistes Université de StanfordÀ propos de ce cours
69,604 consultations récentes
Résultats de carrière des étudiants
20%
ont commencé une nouvelle carrière après avoir terminé ce cours
18%
ont bénéficié d'un avantage concret dans leur carrières grâce à ce cours
Certificat partageable
Obtenez un Certificat lorsque vous terminez
100 % en ligne
Commencez dès maintenant et apprenez aux horaires qui vous conviennent.
Cours 1 sur 3 dans le
Dates limites flexibles
Réinitialisez les dates limites selon votre disponibilité.
Niveau avancé
Approx. 67 heures pour terminer
Anglais
Sous-titres : Arabe, Français, Portugais (européen), Chinois (simplifié), Italien, Vietnamien, Coréen, Allemand, Russe, Turc, Anglais, Espagnol
Compétences que vous acquerrez
Bayesian NetworkGraphical ModelMarkov Random Field
Résultats de carrière des étudiants
20%
ont commencé une nouvelle carrière après avoir terminé ce cours
18%
ont bénéficié d'un avantage concret dans leur carrières grâce à ce cours
Certificat partageable
Obtenez un Certificat lorsque vous terminez
100 % en ligne
Commencez dès maintenant et apprenez aux horaires qui vous conviennent.
Cours 1 sur 3 dans le
Dates limites flexibles
Réinitialisez les dates limites selon votre disponibilité.
Niveau avancé
Approx. 67 heures pour terminer
Anglais
Sous-titres : Arabe, Français, Portugais (européen), Chinois (simplifié), Italien, Vietnamien, Coréen, Allemand, Russe, Turc, Anglais, Espagnol
Offert par
Université de Stanford
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
Programme du cours : ce que vous apprendrez dans ce cours
1 heure pour terminer
Introduction and Overview
This module provides an overall introduction to probabilistic graphical models, and defines a few of the key concepts that will be used later in the course.
1 heure pour terminer
4 vidéos (Total 35 min)
1 exercice pour s'entraîner
Basic Definitions30 min
12 heures pour terminer
Bayesian Network (Directed Models)
In this module, we define the Bayesian network representation and its semantics. We also analyze the relationship between the graph structure and the independence properties of a distribution represented over that graph. Finally, we give some practical tips on how to model a real-world situation as a Bayesian network.
12 heures pour terminer
15 vidéos (Total 190 min), 6 lectures, 4 quiz
15 vidéos
Reasoning Patterns9 min
Flow of Probabilistic Influence14 min
Conditional Independence12 min
Independencies in Bayesian Networks18 min
Naive Bayes9 min
Application - Medical Diagnosis9 min
Knowledge Engineering Example - SAMIAM14 min
Basic Operations 13 min
Moving Data Around 16 min
Computing On Data 13 min
Plotting Data 9 min
Control Statements: for, while, if statements 12 min
Vectorization 13 min
Working on and Submitting Programming Exercises 3 min
6 lectures
Setting Up Your Programming Assignment Environment10 min
Installing Octave/MATLAB on Windows10 min
Installing Octave/MATLAB on Mac OS X (10.10 Yosemite and 10.9 Mavericks)10 min
Installing Octave/MATLAB on Mac OS X (10.8 Mountain Lion and Earlier)10 min
Installing Octave/MATLAB on GNU/Linux10 min
More Octave/MATLAB resources10 min
3 exercices pour s'entraîner
Bayesian Network Fundamentals30 min
Bayesian Network Independencies30 min
Octave/Matlab installation30 min
2 heures pour terminer
Template Models for Bayesian Networks
In many cases, we need to model distributions that have a recurring structure. In this module, we describe representations for two such situations. One is temporal scenarios, where we want to model a probabilistic structure that holds constant over time; here, we use Hidden Markov Models, or, more generally, Dynamic Bayesian Networks. The other is aimed at scenarios that involve multiple similar entities, each of whose properties is governed by a similar model; here, we use Plate Models.
2 heures pour terminer
4 vidéos (Total 66 min)
4 vidéos
Temporal Models - DBNs23 min
Temporal Models - HMMs12 min
Plate Models20 min
1 exercice pour s'entraîner
Template Models30 min
12 heures pour terminer
Structured CPDs for Bayesian Networks
A table-based representation of a CPD in a Bayesian network has a size that grows exponentially in the number of parents. There are a variety of other form of CPD that exploit some type of structure in the dependency model to allow for a much more compact representation. Here we describe a number of the ones most commonly used in practice.
12 heures pour terminer
4 vidéos (Total 49 min)
4 vidéos
Tree-Structured CPDs14 min
Independence of Causal Influence13 min
Continuous Variables13 min
2 exercices pour s'entraîner
Structured CPDs30 min
BNs for Genetic Inheritance PA Quiz30 min
18 heures pour terminer
Markov Networks (Undirected Models)
In this module, we describe Markov networks (also called Markov random fields): probabilistic graphical models based on an undirected graph representation. We discuss the representation of these models and their semantics. We also analyze the independence properties of distributions encoded by these graphs, and their relationship to the graph structure. We compare these independencies to those encoded by a Bayesian network, giving us some insight on which type of model is more suitable for which scenarios.
18 heures pour terminer
7 vidéos (Total 106 min)
7 vidéos
Pairwise Markov Networks10 min
General Gibbs Distribution15 min
Conditional Random Fields22 min
Independencies in Markov Networks4 min
I-maps and perfect maps20 min
Log-Linear Models22 min
Shared Features in Log-Linear Models8 min
2 exercices pour s'entraîner
Markov Networks30 min
Independencies Revisited30 min
22 heures pour terminer
Decision Making
In this module, we discuss the task of decision making under uncertainty. We describe the framework of decision theory, including some aspects of utility functions. We then talk about how decision making scenarios can be encoded as a graphical model called an Influence Diagram, and how such models provide insight both into decision making and the value of information gathering.
22 heures pour terminer
3 vidéos (Total 61 min)
2 exercices pour s'entraîner
Decision Theory30 min
Decision Making PA Quiz30 min
Avis
Meilleurs avis pour PROBABILISTIC GRAPHICAL MODELS 1: REPRESENTATION
par AM2 nov. 2018
Overall very good quality content. PAs are useful but some questions/tests leave too much to interpretation and can be frustrating for students. Audio quality for the classes could also be improved.
par BM27 juin 2017
The lecture was a bit too compact and unsystematic. However, if you also do a lot of reading of the textbook, you can learn a lot. Besides, the Quiz and Programming task are of high qualities.
par ST12 juil. 2017
Prof. Koller did a great job communicating difficult material in an accessible manner. Thanks to her for starting Coursera and offering this advanced course so that we can all learn...Kudos!!
par CM22 oct. 2017
The course was deep, and well-taught. This is not a spoon-feeding course like some others. The only downside were some "mechanical" problems (e.g. code submission didn't work for me).
À propos du Spécialisation Modèles graphiques probabilistes
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.
Foire Aux Questions
Quand aurai-je accès aux vidéos de cours et aux devoirs ?
À quoi ai-je droit si je m'abonne à cette Spécialisation ?
Is financial aid available?
Learning Outcomes: By the end of this course, you will be able to
D'autres questions ? Visitez le Centre d'Aide pour les Etudiants.
