Search for dissertations about: "Inference"
Showing result 11 - 15 of 547 swedish dissertations containing the word Inference.
-
11. Bayesian Inference in Large Data Problems
Abstract : In the last decade or so, there has been a dramatic increase in storage facilities and the possibility of processing huge amounts of data. This has made large high-quality data sets widely accessible for practitioners. This technology innovation seriously challenges traditional modeling and inference methodology. READ MORE
-
12. Variational Inference of Dynamic Factor Models
Abstract : When we make difficult and crucial decisions, forecasts are powerful and important tools. For that purpose, statistical models can be our most effective aid. Ideally, these models can incorporate large sets of multifaceted data. READ MORE
-
13. Towards Reliable Gene Regulatory Network Inference
Abstract : Phenotypic traits are now known to stem from the interplay between genetic variables across many if not every level of biology. The field of gene regulatory network (GRN) inference is concerned with understanding the regulatory interactions between genes in a cell, in order to build a model that captures the behaviour of the system. READ MORE
-
14. Robust inference of gene regulatory networks : System properties, variable selection, subnetworks, and design of experiments
Abstract : In this thesis, inference of biological networks from in vivo data generated by perturbation experiments is considered, i.e. deduction of causal interactions that exist among the observed variables. Knowledge of such regulatory influences is essential in biology. READ MORE
-
15. 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