One prominent method to perform inference on probabilistic graphical models is the probability propagation in trees of clusters (PPTC) algorithm. In this paper, we demonstrate the use of partial evaluation, an established technique from the compiler domain, to improve the performance of online Bayesian inference using the PPTC algorithm in the context of observed evidence. We present a metaprogramming-based method to transform a base program into an optimized version by precomputing the static input at compile time while guaranteeing behavioral equivalence. We achieve an inference time reduction of 21% on average for the Promedas benchmark.</p
Many researches have been done for efficient computation of probabilistic queries posed to Bayesian ...
The junction tree approach, with applications in artificial intelligence, computer vision, machine l...
AbstractAbductive inference in Bayesian belief networks (BBN) is intended as the process of generati...
One prominent method to perform inference on probabilistic graphical models is the probability propa...
Abstract In this paper we present a junction tree based inference architecture exploiting the struct...
UnrestrictedProbabilistic graphical models such as Bayesian networks and junction trees are widely u...
The efficiency of algorithms using secondary structures for probabilistic inference in Bayesian netw...
Belief networks are popular tools for encoding uncertainty in expert systems. These networks rely on...
We present Incremental Thin Junction Trees, a general framework for approximate inference in stati...
We present the first truly polynomial algorithm for PAC-learning the structure of bounded-treewidth ...
| openaire: EC/H2020/871042/EU//SoBigData-PlusPlusBayesian networks are popular probabilistic models...
We introduce a methodology for performing approximate computations in complex probabilistic expert s...
This thesis consists of four papers studying structure learning and Bayesian inference in probabilis...
The paper presents a parameterized approximation scheme for probabilistic inference. The scheme, cal...
We show that the expected computational complexity of the Junction-Tree Algorithm for maximum a post...
Many researches have been done for efficient computation of probabilistic queries posed to Bayesian ...
The junction tree approach, with applications in artificial intelligence, computer vision, machine l...
AbstractAbductive inference in Bayesian belief networks (BBN) is intended as the process of generati...
One prominent method to perform inference on probabilistic graphical models is the probability propa...
Abstract In this paper we present a junction tree based inference architecture exploiting the struct...
UnrestrictedProbabilistic graphical models such as Bayesian networks and junction trees are widely u...
The efficiency of algorithms using secondary structures for probabilistic inference in Bayesian netw...
Belief networks are popular tools for encoding uncertainty in expert systems. These networks rely on...
We present Incremental Thin Junction Trees, a general framework for approximate inference in stati...
We present the first truly polynomial algorithm for PAC-learning the structure of bounded-treewidth ...
| openaire: EC/H2020/871042/EU//SoBigData-PlusPlusBayesian networks are popular probabilistic models...
We introduce a methodology for performing approximate computations in complex probabilistic expert s...
This thesis consists of four papers studying structure learning and Bayesian inference in probabilis...
The paper presents a parameterized approximation scheme for probabilistic inference. The scheme, cal...
We show that the expected computational complexity of the Junction-Tree Algorithm for maximum a post...
Many researches have been done for efficient computation of probabilistic queries posed to Bayesian ...
The junction tree approach, with applications in artificial intelligence, computer vision, machine l...
AbstractAbductive inference in Bayesian belief networks (BBN) is intended as the process of generati...