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.
Ce cours fait partie de la Spécialisation Modèles graphiques probabilistes
19 300 déjà inscrits
Offert par
Spécialisation Modèles graphiques probabilistes Université de StanfordÀ propos de ce cours
6 332 consultations récentes
Dates limites flexibles
Réinitialisez les dates limites selon votre disponibilité.
Certificat partageable
Obtenez un Certificat lorsque vous terminez
100 % en ligne
Commencez dès maintenant et apprenez aux horaires qui vous conviennent.
Cours 3 sur 3 dans le
Niveau avancé
Approx. 66Â heures pour terminer
Anglais
Sous-titres : Français, Portugais (européen), Russe, Anglais, Espagnol
Compétences que vous acquerrez
- Algorithms
- Expectation–Maximization (EM) Algorithm
- Graphical Model
- Markov Random Field
Dates limites flexibles
Réinitialisez les dates limites selon votre disponibilité.
Certificat partageable
Obtenez un Certificat lorsque vous terminez
100 % en ligne
Commencez dès maintenant et apprenez aux horaires qui vous conviennent.
Cours 3 sur 3 dans le
Niveau avancé
Approx. 66Â heures pour terminer
Anglais
Sous-titres : Français, Portugais (européen), Russe, 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 de cours : ce que vous apprendrez dans ce cours
16Â minutes pour terminer
Learning: Overview
This module presents some of the learning tasks for probabilistic graphical models that we will tackle in this course.
16Â minutes pour terminer
1 vidéo (Total 16 min)
1Â heure pour terminer
Review of Machine Learning Concepts from Prof. Andrew Ng's Machine Learning Class (Optional)
This module contains some basic concepts from the general framework of machine learning, taken from Professor Andrew Ng's Stanford class offered on Coursera. Many of these concepts are highly relevant to the problems we'll tackle in this course.
1Â heure pour terminer
6 vidéos (Total 59 min)
2Â heures pour terminer
Parameter Estimation in Bayesian Networks
This module discusses the simples and most basic of the learning problems in probabilistic graphical models: that of parameter estimation in a Bayesian network. We discuss maximum likelihood estimation, and the issues with it. We then discuss Bayesian estimation and how it can ameliorate these problems.
2Â heures pour terminer
5 vidéos (Total 77 min)
21Â heures pour terminer
Learning Undirected Models
In this module, we discuss the parameter estimation problem for Markov networks - undirected graphical models. This task is considerably more complex, both conceptually and computationally, than parameter estimation for Bayesian networks, due to the issues presented by the global partition function.
21Â heures pour terminer
3 vidéos (Total 52 min)
18Â heures pour terminer
Learning BN Structure
This module discusses the problem of learning the structure of Bayesian networks. We first discuss how this problem can be formulated as an optimization problem over a space of graph structures, and what are good ways to score different structures so as to trade off fit to data and model complexity. We then talk about how the optimization problem can be solved: exactly in a few cases, approximately in most others.
18Â heures pour terminer
7 vidéos (Total 106 min)
22Â heures pour terminer
Learning BNs with Incomplete Data
In this module, we discuss the problem of learning models in cases where some of the variables in some of the data cases are not fully observed. We discuss why this situation is considerably more complex than the fully observable case. We then present the Expectation Maximization (EM) algorithm, which is used in a wide variety of problems.
22Â heures pour terminer
5 vidéos (Total 83 min)
Avis
- 5 stars71,42Â %
- 4 stars19,72Â %
- 3 stars5,44Â %
- 2 stars2,72Â %
- 1 star0,68Â %
Meilleurs avis pour PROBABILISTIC GRAPHICAL MODELS 3: LEARNING
par RL22 mars 2021
Excellent course. Assignments are challenging but once you figure them out you will have a solid understanding of PGM.
par LC22 févr. 2019
A great course! Learned a lot. Especially the assignments are excellent! Thanks a lot.
par AK8 nov. 2017
Awesome course... builds intuitive thinking for developing intelligent algorithms...
par RC6 mai 2020
Plz give practical assignments in Python. Matlab is not free and not many and neither myself know Matlab.
À 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 ?
Une aide financière est-elle possible ?
Learning Outcomes: By the end of this course, you will be able to
D'autres questions ? Visitez le Centre d'Aide pour les Étudiants.
