Approximation strategies for structure learning in Bayesian networks

Add to your list(s) Download to your calendar using vCal

• Teppo Niinimaki
• Tuesday 07 June 2016, 09:30-10:30
• Engineering Department, CBL Room BE-438.

If you have a question about this talk, please contact Louise Segar.

This talk has been canceled/deleted

Abstract: Structure discovery in Bayesian networks has attracted considerable interest in the recent decades. Attention has mostly been paid to finding a structure that best fits the data under certain criterion. The optimization approach can lead to noisy and partly arbitrary results due to the uncertainty caused by a small amount of data. The so-called full Bayesian approach addresses this shortcoming by learning the posterior distribution of structures. In practice, the posterior distribution is summarized by constructing a representative sample of structures, or by computing marginal posterior probabilities of individual arcs or other substructures. The state-of-the-art sampling algorithms draw orderings of variables along a Markov chain. We have proposed several improvements to these algorithms. In this talk I discuss these improvements.

This talk is part of the Machine Learning @ CUED series.

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.