Toward a Generalized Bayesian Network
Dawn E. Holmes · AIP conference proceedings · 2006
The author’s past work in this area has shown that the probability of a state of a Bayesian network, found using the standard Bayesian techniques, could be equated to the Maximum Entropy solution and that this result enabled us to find minimally prejudiced estimates of missing information in Bayesian networks. In this paper we show that in the class of Bayesian networks known as Bayesian trees, we are able to determine missing constraint values optimally using only the maximum entropy formalism. Bayesian networks that are specified entirely within the maximum entropy formalism, whether or not information is missing, are called generalized Bayesian networks. It is expected that further work will fully generalize this result.