Acerca de este curso: 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 the first in a sequence of three. It describes the two basic PGM representations: Bayesian Networks, which rely on a directed graph; and Markov networks, which use an undirected graph. The course discusses both the theoretical properties of these representations as well as their use in practice. The (highly recommended) honors track contains several hands-on assignments on how to represent some real-world problems. The course also presents some important extensions beyond the basic PGM representation, which allow more complex models to be encoded compactly.
Creada por: Universidad de Stanford
Enseñado por: Daphne Koller, Professor
School of Engineering
| Información básica | Curso 1 de 3 en Probabilistic Graphical Models Specialization |
| Nivel | Advanced |
| Idioma | English |
| Cómo aprobar | Aprueba todas las tareas calificadas para completar el curso. |
| Calificaciones del usuario |
Programa
SEMANA 1
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.
4 videos
- Vídeo: Overview and Motivation
- Vídeo: Distributions
- Vídeo: Factors
Calificado: Basic Definitions
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.
15 videos, 6 readings
- Vídeo: Reasoning Patterns
- Vídeo: Flow of Probabilistic Influence
- Vídeo: Conditional Independence
- Vídeo: Independencies in Bayesian Networks
- Vídeo: Naive Bayes
- Vídeo: Application - Medical Diagnosis
- Vídeo: Knowledge Engineering Example - SAMIAM
- Leyendo: Setting Up Your Programming Assignment Environment
- Leyendo: Installing Octave/MATLAB on Windows
- Leyendo: Installing Octave/MATLAB on Mac OS X (10.10 Yosemite and 10.9 Mavericks)
- Leyendo: Installing Octave/MATLAB on Mac OS X (10.8 Mountain Lion and Earlier)
- Leyendo: Installing Octave/MATLAB on GNU/Linux
- Leyendo: More Octave/MATLAB resources
- Vídeo: Basic Operations
- Vídeo: Moving Data Around
- Vídeo: Computing On Data
- Vídeo: Plotting Data
- Vídeo: Control Statements: for, while, if statements
- Vídeo: Vectorization
- Vídeo: Working on and Submitting Programming Exercises
Calificado: Bayesian Network Fundamentals
Calificado: Bayesian Network Independencies
Calificado: Octave/Matlab installation
Calificado: Simple BN Knowledge Engineering
SEMANA 2
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.
4 videos
- Vídeo: Temporal Models - DBNs
- Vídeo: Temporal Models - HMMs
- Vídeo: Plate Models
Calificado: Template Models
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.
4 videos
- Vídeo: Tree-Structured CPDs
- Vídeo: Independence of Causal Influence
- Vídeo: Continuous Variables
Calificado: Structured CPDs
Calificado: BNs for Genetic Inheritance
Calificado: BNs for Genetic Inheritance PA Quiz
SEMANA 3
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.
7 videos
- Vídeo: General Gibbs Distribution
- Vídeo: Conditional Random Fields
- Vídeo: Independencies in Markov Networks
- Vídeo: I-maps and perfect maps
- Vídeo: Log-Linear Models
- Vídeo: Shared Features in Log-Linear Models
Calificado: Markov Networks
Calificado: Independencies Revisited
Calificado: Markov Networks for OCR
SEMANA 4
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.
3 videos
- Vídeo: Utility Functions
- Vídeo: Value of Perfect Information
Calificado: Decision Theory
Calificado: Decision Making
Calificado: Decision Making PA Quiz
SEMANA 5
Knowledge Engineering & Summary
This module provides an overview of graphical model representations and some of the real-world considerations when modeling a scenario as a graphical model. It also includes the course final exam.
1 video
Calificado: Representation Final Exam
Preguntas Frecuentes
Cómo funciona
Trabajo del curso
Cada curso es como un libro de texto interactivo, con videos pregrabados, cuestionarios y proyectos.
Ayuda de tus compañeros
Conéctate con miles de estudiantes y debate ideas y materiales del curso, y obtén ayuda para dominar los conceptos.
Certificados
Obtén reconocimiento oficial por tu trabajo y comparte tu éxito con amigos, compañeros y empleadores.
Creadores
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.
Tarifa
| Comprar curso | |
|---|---|
| Accede a los materiales del curso | Disponible |
| Accede a los materiales con calificación | Disponible |
| Recibe una calificación final | Disponible |
| Obtén un Certificado de curso para compartir | Disponible |
Calificaciones y revisiones
I really enjoyed this course. Prof Koller presents the material very well, and it's really interesting to see how probabilistic graphical model frameworks are underpinned mathematically. I thought it was a pretty tough course at points, and while the lectures are good I found having a copy of Prof Koller's textbook very useful.
I would give this course 5 stars, but I thought some of the programming assignments involved too much grappling with MATLAB rather than illuminating the principles in the lectures. Also, I think the order of the lectures may have been changed since the course was first run as there are occasional references to things that have not been covered at that point.
Overall though, very enjoyable. I'm looking forward to parts 2 and 3.
This was my first experience with Coursera! Thanks prof. Daphne Koller for this course and Coursera at all.
a bit too hard if you don't have enough probability knowledge
Coursera brinda acceso universal a la mejor educación del mundo, al asociarse con las mejores universidades y organizaciones, para ofrecer cursos en línea.
© 2018 Coursera Inc. Todos los derechos reservados.
Very informative. The only drawback is lack of rigorous proof and clear definition summaries.