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.
제공자:
이 강좌에 대하여
최근 조회 10,097회
유동적 마감일
일정에 따라 마감일을 재설정합니다.
공유 가능한 수료증
완료 시 수료증 획득
100% 온라인
지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.
다음 특화 과정의 3개 강좌 중 2번째 강좌:
고급 단계
완료하는 데 약 38시간 필요
영어
자막: 프랑스어, 포르투갈어 (유럽), 러시아어, 영어, 스페인어
귀하가 습득할 기술
InferenceGibbs SamplingMarkov Chain Monte Carlo (MCMC)Belief Propagation
유동적 마감일
일정에 따라 마감일을 재설정합니다.
공유 가능한 수료증
완료 시 수료증 획득
100% 온라인
지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.
다음 특화 과정의 3개 강좌 중 2번째 강좌:
고급 단계
완료하는 데 약 38시간 필요
영어
자막: 프랑스어, 포르투갈어 (유럽), 러시아어, 영어, 스페인어
제공자:
스탠퍼드 대학교
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.
강의 계획 - 이 강좌에서 배울 내용
완료하는 데 25분 필요
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).
완료하는 데 25분 필요
2개 동영상 (총 25분)
완료하는 데 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.
완료하는 데 1시간 필요
4개 동영상 (총 56분)
완료하는 데 18시간 필요
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 inference algorithms. We focus here on the basic framework and on its instantiation in the exact case of clique tree propagation. An optional lesson describes the loopy belief propagation (LBP) algorithm and its properties.
완료하는 데 18시간 필요
9개 동영상 (총 150분)
완료하는 데 2시간 필요
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 probabilities, except that we need to also consider how to decode the results to construct a single assignment. In an optional module, we describe a few other algorithms that are able to use very different techniques by exploiting the combinatorial optimization nature of the MAP task.
완료하는 데 2시간 필요
5개 동영상 (총 74분)
완료하는 데 15시간 필요
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 Gibbs sampling algorithm, as well as a family of methods known as Metropolis-Hastings.
완료하는 데 15시간 필요
5개 동영상 (총 100분)
완료하는 데 1시간 필요
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.
완료하는 데 1시간 필요
1개 동영상 (총 20분)
검토
PROBABILISTIC GRAPHICAL MODELS 2: INFERENCE의 최상위 리뷰
AT 제공2019년 8월 22일
Just like the first course of the specialization, this course is really good. It is well organized and taught in the best way which really helped me to implement similar ideas for my projects.
AL 제공2019년 8월 19일
I have clearly learnt a lot during this course. Even though some things should be updated and maybe completed, I would definitely recommend it to anyone whose interest lies in PGMs.
LC 제공2018년 7월 31일
Very good course. Subject is quiet complex: lack of concrete examples to make sure concepts well understood. Had to review each the Course twice to understand concepts well
RG 제공2020년 5월 15일
Great course. The assignments are old and are not worth doing it. But the content is good for those who are interested in Probabilistic Graphical Models basics.
Probabilistic Graphical Models 특화 과정 정보
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.
자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
이 전문 분야를 구독하면 무엇을 이용할 수 있나요?
재정 지원을 받을 수 있나요?
Learning Outcomes: By the end of this course, you will be able to take a given PGM and
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.
