Sökning: "Graphical"

Visar resultat 1 - 5 av 280 avhandlingar innehållade ordet Graphical.

1. 1. Perspectives on Probabilistic Graphical Models

   Författare :Dong Liu; Ragnar Thobaben; Harri Lähdesmäki; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Bayesian methods; graphical models; inference; learning; statistics; Electrical Engineering; Elektro- och systemteknik;

   Sammanfattning : Probabilistic graphical models provide a natural framework for the representation of complex systems and offer straightforward abstraction for the interactions within the systems. Reasoning with help of probabilistic graphical models allows us to answer inference queries with uncertainty following the framework of probability theory. LÄS MER

3. 2. On Bayesian graphical model determination

   Författare :Jukka Corander; Carlo Berzuini; Stockholms universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Bayesian inference; Entropy; Exponential models; Graphical models; Logarithmic utility; Statistics; Statistik; statistik; Statistics;

   Sammanfattning : A graphical model specifies a graph representation of the independence structure of a multivariate distribution, where nodes represent variables and edges association between variables.This thesis introduces methodology for determination of graphical models for multivariate distributions within the exponential family. LÄS MER

4. 3. Bayesian structure learning in graphical models

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

   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

5. 4. Bayesian inference in probabilistic graphical models

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

   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

7. 5. Inference in Temporal Graphical Models

   Författare :Jonas Hallgren; Timo Koski; Dubhashi Devdatt; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Tillämpad matematik och beräkningsmatematik; Applied and Computational Mathematics;

   Sammanfattning : This thesis develops mathematical tools used to model and forecast different economic phenomena. The primary starting point is the temporal graphical model. Four main topics, all with applications in finance, are studied. LÄS MER