Complexity of Variable Elimination

video-placeholder
Loading...
View Syllabus

Skills You'll Learn

Inference, Gibbs Sampling, Markov Chain Monte Carlo (MCMC), Belief Propagation

Reviews

4.6 (473 ratings)

  • 5 stars
    71.03%
  • 4 stars
    21.35%
  • 3 stars
    5.28%
  • 2 stars
    1.05%
  • 1 star
    1.26%

LL

Mar 11, 2017

Thanks a lot for professor D.K.'s great course for PGM inference part. Really a very good starting point for PGM model and preparation for learning part.

LC

Feb 2, 2019

Very great course! A lot of things have been learnt. The lectures, quiz and assignments clear up all key concepts. Especially, assignments are wonderful!

From the lesson

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.

Taught By

  • Placeholder

    Daphne Koller

    Professor

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.