Sökning: "decomposable graphs"
Hittade 3 avhandlingar innehållade orden decomposable graphs.
1. Algorithms and minimal forbidden minors for tree-decomposable graphs
Sammanfattning : .... LÄS MER
2. Bayesian inference in probabilistic graphical models
Sammanfattning : 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. LÄS MER
3. Bayesian structure learning in graphical models
Sammanfattning : 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. LÄS MER