KTH Matematik  

Matematisk Statistik

Tid: 28 januari 2016 kl 14.00

Seminarierummet 3418, Institutionen för Matematik, KTH, Lindstedtsvägen 25, plan 4. Karta!

Föredragshållare: Licentiatseminarium: Felix Rios

Titel: Bayesian structure learning in graphical models

Granskare: Klas Markström

Huvudhandledare: Tatjana Pavlenko

Abstract Paper A, presents a novel family of graph theoretical algorithms, called the junction tree expanders, that incrementally construct junction trees for decomposable graphs. Due to its Markovian property, the junction tree expanders are shown to be suitable for proposal kernels in a sequential Monte Carlo (SMC) sampling scheme for approximating a graph posterior distribution. A simulation study is performed for the case of Gaussian decomposable graphical models showing efficiency of the suggested unified approach for both structural and parametric Bayesian inference. Paper B, develops a novel prior distribution over DAGs with the ability to express prior knowledge in terms of graph layerings. In conjunction with the prior, a search and score algorithm based on the layering property of DAGs, is developed for performing structure learning in Bayesian networks. A simulation study shows that the search and score algorithm along with the prior has superior performance for learning graph with a clearly layered structure compared with other priors.

Till seminarielistan
To the list of seminars

Sidansvarig: Filip Lindskog
Uppdaterad: 25/02-2009