Search for dissertations about: "decomposable graphs"

Found 3 swedish dissertations containing the words decomposable graphs.

2. 1. Algorithms and minimal forbidden minors for tree-decomposable graphs

   Author : Jens Lagergren; Stockholms universitet; []
   Keywords : ;

   Abstract : .... READ MORE

4. 2. Bayesian inference in probabilistic graphical models

   Author : Felix Leopoldo Rios; Tatjana Pavlenko; Alun Thomas; KTH; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Graphical models; Bayesian inference; predictive classification; decomposable graphs; Tillämpad matematik och beräkningsmatematik; Applied and Computational Mathematics;

   Abstract : This thesis consists of four papers studying structure learning and Bayesian inference in probabilistic graphical models for both undirected and directed acyclic graphs (DAGs).Paper A presents a novel algorithm, called the Christmas tree algorithm (CTA), that incrementally construct junction trees for decomposable graphs by adding one node at a time to the underlying graph. READ MORE

5. 3. Bayesian structure learning in graphical models

   Author : Felix Leopoldo Rios; Tatjana Pavlenko; Klas Markström; KTH; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Bayesian statistics; graphical models; Bayesian networks; Markov networks; structure learning; Tillämpad matematik och beräkningsmatematik; Applied and Computational Mathematics;

   Abstract : This thesis consists of two papers studying structure learning in probabilistic graphical models for both undirected graphs anddirected acyclic graphs (DAGs).Paper A, presents a novel family of graph theoretical algorithms, called the junction tree expanders, that incrementally construct junction trees for decomposable graphs. READ MORE