Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 46 for “"probabilistic graphical models"”.
-
Probabilistic Graphical Models for Crowdsourcing and Turbulence
Graphical models provide a useful framework and formalism from which to modeland solve problems involving random processes. We demonstrate the versatility and usefulness of graphical models on two problems, one involving crowdsourcing and one involving turbulence. In crowdsourcing, we consider the …
-
Predictive genomics in asthma management using probabilistic graphical models
… addressed with the creation of a novel method. Probabilistic graphical models (PGMs) are a powerful technique that can overcome limitations of conventional association study approaches.
-
Investigation of connection between deep learning and probabilistic graphical models
… link between these fields. The link focuses on probabilistic graphical models in the context of reinforcement learning. Viewing certain algorithms as reinforcement learning gives one an ability to map ML concepts to statistics problems. Training a multi-layer nonlinear perceptron algorithm is …
-
Constrained Information Exchange Message Passing Algorithm in Probabilistic Graphical Models
Probabilistic graphical models combine probability and graph theory into a powerful multivariate statistical modeling approach. While there is an extraordinary range of types of graphical models in the broader literature, we focus on Hidden Markov Model (HMM) and Linear Dynamical System (LDS). …
-
Probabilistic graphical models : distributed inference and learning models with small feedback vertex sets
In undirected graphical models, each node represents a random variable while the set of edges specifies the conditional independencies of the underlying distribution. When the random variables are jointly Gaussian, the models are called Gaussian graphical models (GGMs) or Gauss Markov random …
-
A Comparison of Case-Based Reasoning and Probabilistic Graphical Models in the Context of Learning from Observation
… techniques of learning from observation: Probabilistic Graphical Models (PGM) and Case-Based Reasoning (CBR) with the goal of identifying a preferred approach for future improvement. We show that the Naive Bayes Classifier is better than a previously used PGM model in learning behavior in …
-
Lifted Inference for Relational Hybrid Models
Probabilistic Graphical Models (PGMs) promise to play a prominent role in many complex real-world systems. Probabilistic Relational Graphical Models (PRGMs) scale the representation and learning of PGMs. Answering questions using PRGMs enables many current and future applications, such as medical …
-
Safety of Flight Prediction for Small Unmanned Aerial Vehicles Using Dynamic Bayesian Networks
… After reviewing the basic theory underlying probabilistic graphical models and Bayesian estimation, the thesis presents a user-defined static Bayesian network, a static Bayesian network in which the parameter values are learned from data, and a dynamic Bayesian network with learning. As a …
-
A model-adaptive universal data compression architecture with applications to image compression
… Low-Density-Parity-Check Codes for encoding and probabilistic graphical models and message-passing algorithms for decoding. We implement a lossless bi-level image data compressor as well as a lossy greyscale image compressor and explain how these compressors can rapidly adapt to changes in source …
-
Belief propagation on factor graph neural networks
Probabilistic graphical models are a statistical framework for conditionally dependent random variables with dependencies represented by graphs. A traditional method to perform inference over these random variables is Belief Propagation. Belief Propagation can be used to compute an exact solution …
-
Think global, act local when estimating a sparse precision matrix
… precision matrices. Using the framework of probabilistic graphical models, the algorithm performs robust covariance estimation to generate potentials for small cliques and fuses the local structures to form a sparse yet globally robust model of the entire distribution. Identification of …
-
Multiple Uses of Frequent Episodes in Temporal Process Modeling
… partial orders, but the direct inference of such models from data has been computationally intensive or even intractable. In this work, we propose the mining of frequent episodes as a bridge to inferring more formal models of temporal processes. This enables us to combine the advantages of …
-
Inference in Ising models by graph neural networks with structural features
Probabilistic graphical models (PGMs) are powerful frameworks for modeling interactions between random variables. The two major inference tasks on PGMs are marginal probability inference and maximum-a-posteriori (MAP) inference. Exact inference on PGMs is intractable, hence approximation …
-
Health-AIM: An artificial intelligence approach for inference with clinical health datasets
… health domain, artificial intelligence (AI) models need to use data to make reliable decisions regarding patient trajectories and treatments. Incorrect decisions can lead to strain on both caregiver and patient, and clinical datasets often have low volume, high dimensionality, and many …
-
Discriminative training of hidden Markov Models for gesture recognition
… problem of modelling temporal data. Non-temporal models can be used for gesture recognition, but require that the signals be adapted to the models. For example, the requirement of fixed-length inputs for support-vector machine classification. Hidden Markov models are probabilistic graphical models …
-
Greedy structure learning of Markov Random Fields
Probabilistic graphical models are used in a variety of domains to capture and represent general dependencies in joint probability distributions. In this document we examine the problem of learning the structure of an undirected graphical model, also called a Markov Random Field (MRF), given a set …
-
Messaging for large-scale distributed computation with factor graphs
… for efficient inference in the framework of probabilistic graphical models cf. [22, 15, 30]. We show that message passing over Factor Graphs is Turing-complete. As an important contribution of this work, we show that a Factor Graph can be realized using any Publisher-Subscriber (PubSub) …
-
Graphical models and message-passing algorithms for network-constrained decision problems
… scientific fields and engineering applications. Probabilistic graphical models provide a scalable framework for developing efficient inference methods, such as message-passing algorithms that exploit the conditional independencies encoded by the given graph. Conceptually, this framework extends …
Page 1 of 3