Multiplicative Factorization of Noisy-Max

01/23/2013
by   Masami Takikawa, et al.
0

The noisy-or and its generalization noisy-max have been utilized to reduce the complexity of knowledge acquisition. In this paper, we present a new representation of noisy-max that allows for efficient inference in general Bayesian networks. Empirical studies show that our method is capable of computing queries in well-known large medical networks, QMR-DT and CPCS, for which no previous exact inference method has been shown to perform well.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/16/2014

Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference

Previous studies have demonstrated that encoding a Bayesian network into...
research
01/31/2023

Learning noisy-OR Bayesian Networks with Max-Product Belief Propagation

Noisy-OR Bayesian Networks (BNs) are a family of probabilistic graphical...
research
06/15/2021

Markov Equivalence of Max-Linear Bayesian Networks

Max-linear Bayesian networks have emerged as highly applicable models fo...
research
01/12/2015

A fast numerical method for max-convolution and the application to efficient max-product inference in Bayesian networks

Observations depending on sums of random variables are common throughout...
research
05/15/2021

The Permute-and-Flip Mechanism is Identical to Report-Noisy-Max with Exponential Noise

The permute-and-flip mechanism is a recently proposed differentially pri...
research
03/06/2013

A Generalization of the Noisy-Or Model

The Noisy-Or model is convenient for describing a class of uncertain rel...
research
12/12/2012

Exploiting Functional Dependence in Bayesian Network Inference

We propose an efficient method for Bayesian network inference in models ...

Please sign up or login with your details

Forgot password? Click here to reset