BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Graphical Models - Christopher M. Bishop\, Microsoft Research\, Ca
 mbridge
DTSTART:20080117T160000Z
DTEND:20080117T180000Z
UID:TALK8214@talks.cam.ac.uk
CONTACT:Zoubin Ghahramani
DESCRIPTION:This tutorial will provide an introduction to the important fi
 eld of probabilistic graphical models\, which play a central role in the m
 odern view of machine learning. It will cover the main types of graphical 
 model and their factorization and conditional independence properties\, an
 d will then explain how inference and learning problems can be solved usin
 g local message passing algorithms. The tutorial will assume familiarity w
 ith probabilities and Bayes' theorem\, but will not assume any previous kn
 owledge of graphical models. 
LOCATION:LT2 (Inglis Building) Engineering\, Department of
END:VEVENT
END:VCALENDAR
