We introduce the structural interface algorithm for exact probabilistic inference in Dynamic Bayesian Networks. It unifies state-of-the-art techniques for inference in static and dynamic networks, by combining principles of knowledge compilation with the interface algorithm. The resulting algorithm not only exploits the repeated structure in the network, but also the local structure, including determinism, parameter equality and context-specific independence. Empirically, we show that the structural interface algorithm speeds up inference in the presence of local structure, and scales to larger and more complex networks
Abstract. This paper addresses an algorithm for probabilistic inference for Bayesian Networks (BNs)....
Lifting can greatly reduce the cost of inference on first-order probabilistic graphical models, but ...
In this thesis we address the problem of leaning Markov network structure from data by presenting th...
Given the complexity of the domains for which we would like to use computers as reasoning engines, ...
We present Incremental Thin Junction Trees, a general framework for approximate inference in stati...
The straightforward representation of many real world problems is in terms of discrete random variab...
The constrained node elimination (CNE) method is a method explicitly designed for exact inference in...
A plethora of networks is being collected in a growing number of fields, including disease transmiss...
In recent years, researchers in the A l domain have used Bayesian belief networks to build models o...
We present a method for dynamically generating Bayesian networks from knowledge bases consisting of ...
This paper addresses the problem of learning structure and parameters of Bayesian and Dynamic Bayesi...
The efficiency of algorithms using secondary structures for probabilistic inference in Bayesian netw...
AbstractWe present an extension of Bayesian networks to probability intervals, aiming at a more real...
Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this...
To learn the network structures used in probabilistic models (e.g., Bayesian network), many research...
Abstract. This paper addresses an algorithm for probabilistic inference for Bayesian Networks (BNs)....
Lifting can greatly reduce the cost of inference on first-order probabilistic graphical models, but ...
In this thesis we address the problem of leaning Markov network structure from data by presenting th...
Given the complexity of the domains for which we would like to use computers as reasoning engines, ...
We present Incremental Thin Junction Trees, a general framework for approximate inference in stati...
The straightforward representation of many real world problems is in terms of discrete random variab...
The constrained node elimination (CNE) method is a method explicitly designed for exact inference in...
A plethora of networks is being collected in a growing number of fields, including disease transmiss...
In recent years, researchers in the A l domain have used Bayesian belief networks to build models o...
We present a method for dynamically generating Bayesian networks from knowledge bases consisting of ...
This paper addresses the problem of learning structure and parameters of Bayesian and Dynamic Bayesi...
The efficiency of algorithms using secondary structures for probabilistic inference in Bayesian netw...
AbstractWe present an extension of Bayesian networks to probability intervals, aiming at a more real...
Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this...
To learn the network structures used in probabilistic models (e.g., Bayesian network), many research...
Abstract. This paper addresses an algorithm for probabilistic inference for Bayesian Networks (BNs)....
Lifting can greatly reduce the cost of inference on first-order probabilistic graphical models, but ...
In this thesis we address the problem of leaning Markov network structure from data by presenting th...