Search for dissertations about: "tree models"
Showing result 1 - 5 of 211 swedish dissertations containing the words tree models.
-
1. Statistical modeling and design in forestry : The case of single tree models
Abstract : Forest quantification methods have evolved from a simple graphical approach to complex regression models with stochastic structural components. Currently, mixed effects models methodology is receiving attention in the forestry literature. READ MORE
-
2. Probabilistic Models for Species Tree Inference and Orthology Analysis
Abstract : A phylogenetic tree is used to model gene evolution and species evolution using molecular sequence data. For artifactual and biological reasons, a gene tree may differ from a species tree, a phenomenon known as gene tree-species tree incongruence. Assuming the presence of one or more evolutionary events, e.g. READ MORE
-
3. Bayesian structure learning in graphical models
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
-
4. Reduction Techniques for Finite (Tree) Automata
Abstract : Finite automata appear in almost every branch of computer science, for example in model checking, in natural language processing and in database theory. In many applications where finite automata occur, it is highly desirable to deal with automata that are as small as possible, in order to save memory as well as excecution time. READ MORE
-
5. Bayesian inference in probabilistic graphical models
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