Probabilistic Graphical Models 2: Inference

Probabilistic Graphical Models 2: Inference

课程
en
英语
此内容评级为 3.8235/5
来源
  • 来自www.coursera.org
状况
  • 自定进度
  • 免费获取
  • 收费证书
更多信息
  • 5 序列
  • 等级 高级

Their employees are learning daily with Edflex

  • Safran
  • Air France
  • TotalEnergies
  • Generali
Learn more

课程详情

教学大纲

  • Week 1 - Inference Overview
    This module provides a high-level overview of the main types of inference tasks typically encountered in graphical models: conditional probability queries, and finding the most likely assignment (MAP inference).
  • Week 1 - Variable Elimination
    This module presents the simplest algorithm for exact inference in graphical models: variable elimination. We describe the algorithm, and analyze its complexity in terms of properties of the graph structure.
  • Week 2 - Belief Propagation Algorithms
    This module describes an alternative view of exact inference in graphical models: that of message passing between clusters each of which encodes a factor over a subset of variables. This framework provides a basis for a variety of exact and approximate inferen...
  • Week 3 - MAP Algorithms
    This module describes algorithms for finding the most likely assignment for a distribution encoded as a PGM (a task known as MAP inference). We describe message passing algorithms, which are very similar to the algorithms for computing conditional probabilitie...
  • Week 4 - Sampling Methods
    In this module, we discuss a class of algorithms that uses random sampling to provide approximate answers to conditional probability queries. Most commonly used among these is the class of Markov Chain Monte Carlo (MCMC) algorithms, which includes the simple G...
  • Week 4 - Inference in Temporal Models
    In this brief lesson, we discuss some of the complexities of applying some of the exact or approximate inference algorithms that we learned earlier in this course to dynamic Bayesian networks.
  • Week 5 - Inference Summary
    This module summarizes some of the topics that we covered in this course and discusses tradeoffs between different algorithms. It also includes the course final exam.

先决条件

没有。

讲师

Daphne Koller
Professor
School of Engineering

编辑

利兰-斯坦福大学(Leland Stanford Junior University),简称斯坦福大学,是一所美国私立大学,位于旧金山南部的硅谷。

其校训是 "Die Luft der Freiheit weht",意为 "自由之风拂面"。

在大多数国际排名中,斯坦福大学都名列世界顶尖大学之列,享有极高的声誉。

平台

Coursera是一家数字公司,提供由位于加利福尼亚州山景城的计算机教师Andrew Ng和达芙妮科勒斯坦福大学创建的大型开放式在线课程。

Coursera与顶尖大学和组织合作,在线提供一些课程,并提供许多科目的课程,包括:物理,工程,人文,医学,生物学,社会科学,数学,商业,计算机科学,数字营销,数据科学 和其他科目。

此内容评级为 3.8235/5
(没有评论)
此内容评级为 3.8235/5
(没有评论)
完成这个资源,写一篇评论