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.
Este curso forma parte de Programa especializado: modelos gráficos de probabilidades
19.461 ya inscrito
ofrecido por
Programa especializado: modelos gráficos de probabilidades Universidad de StanfordAcerca de este Curso
5257 vistas recientes
Fechas lÃmite flexibles
Restablece las fechas lÃmite en función de tus horarios.
Certificado para compartir
Obtén un certificado al finalizar
100Â % en lÃnea
Comienza de inmediato y aprende a tu propio ritmo.
Curso 3 de 3 en
Nivel avanzado
Aprox. 66 horas para completar
Inglés (English)
SubtÃtulos: Francés (French), Portugués (europeo), Ruso (Russian), Inglés (English), Español (Spanish)
Habilidades que obtendrás
- Algorithms
- Expectation–Maximization (EM) Algorithm
- Graphical Model
- Markov Random Field
Fechas lÃmite flexibles
Restablece las fechas lÃmite en función de tus horarios.
Certificado para compartir
Obtén un certificado al finalizar
100Â % en lÃnea
Comienza de inmediato y aprende a tu propio ritmo.
Curso 3 de 3 en
Nivel avanzado
Aprox. 66 horas para completar
Inglés (English)
SubtÃtulos: Francés (French), Portugués (europeo), Ruso (Russian), Inglés (English), Español (Spanish)
ofrecido por
Universidad 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.
Programa - Qué aprenderás en este curso
16 minutos para completar
Learning: Overview
This module presents some of the learning tasks for probabilistic graphical models that we will tackle in this course.
16 minutos para completar
1 video (Total 16 minutos)
1 hora para completar
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 hora para completar
6 videos (Total 59 minutos)
2 horas para completar
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 horas para completar
5 videos (Total 77 minutos)
21 horas para completar
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 horas para completar
3 videos (Total 52 minutos)
18 horas para completar
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 horas para completar
7 videos (Total 106 minutos)
22 horas para completar
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 horas para completar
5 videos (Total 83 minutos)
Reseñas
- 5 stars71,42Â %
- 4 stars19,72Â %
- 3 stars5,44Â %
- 2 stars2,72Â %
- 1 star0,68Â %
Principales reseñas sobre PROBABILISTIC GRAPHICAL MODELS 3: LEARNING
por SJ19 de abr. de 2017
Tougher course than the 2 preceding ones, but definitely worthwhile.
por LL29 de ene. de 2018
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.
por LC22 de feb. de 2019
A great course! Learned a lot. Especially the assignments are excellent! Thanks a lot.
por WZ5 de mar. de 2017
Excellent course! Everyone interested in PGM should consider!
Acerca de Programa especializado: modelos gráficos de probabilidades
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.
Preguntas Frecuentes
¿Cuándo podré acceder a las lecciones y tareas?
¿Qué recibiré si me suscribo a este Programa especializado?
¿Hay ayuda económica disponible?
Learning Outcomes: By the end of this course, you will be able to
¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.
