Entropy and belief networks

Authors:
Norman C. Dalkey
Affiliations:
Department of Computer Science, University of California, Los Angeles, Los Angeles, CA
Venue:
UAI'92 Proceedings of the Eighth international conference on Uncertainty in artificial intelligence
Year:
1992

Citing 2
Cited 0

Evaluating influence diagrams

Operations Research
Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference

Quantified Score

Hi-index	0.00

Visualization

Abstract

The product expansion of conditional probabilities for belief nets is not maximum entropy. This appears to deny a desirable kind of assurance for the model. However, a kind of guarantee that is almost as strong as maximum entropy can be derived. Surprisingly, a variant model also exhibits the guarantee, and for many cases obtains a higher performance score than the product expansion.