Lecture

Approximate Inference Algorithm

In course

Nulla deserunt cupidatat est incididunt tempor. Reprehenderit nostrud sunt laboris Lorem sunt. Commodo voluptate culpa consectetur do laboris esse ad do magna nulla laboris. Elit cupidatat ad enim culpa. In aliquip ullamco sit eu voluptate elit aliqua cillum minim Lorem cupidatat.

Description

This lecture covers the Chow-Liu algorithm for approximate inference, using Cayley's formula to find the number of distinct trees, and generalizing to directed information graphs for optimal tree approximation.

Official source

https://mediaspace.epfl.ch/media/0_wqgmkhkb

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (31)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.