Complexity of Variable Elimination

Loading...
From the course by Stanford University
Probabilistic Graphical Models 2: Inference
246 ratings
Stanford University
246 ratings
Course 2 of 3 in the Specialization Probabilistic Graphical Models
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.

Meet the Instructors

  • Daphne Koller
    Daphne Koller
    Professor
    School of Engineering

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.