Graph-Based Perspective on Variable Elimination

Loading...
En provenance du cours de Université de Stanford
Probabilistic Graphical Models 2: Inference
240 notes
Université de Stanford
240 notes
Cours 2 sur 3 dans Specialization Probabilistic Graphical Models
À partir de la leçon
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.

Rencontrer les enseignants

  • Daphne Koller
    Daphne Koller
    Professor
    School of Engineering