Finding the best complete lattice of discrete Bayesian networks for prediction
Publication Date: 2015-Dec-17
The IP.com Prior Art Database
When using Bayesian networks for predictive purposes, the Bayesian theory calls for using all the possible models, i.e., model averaging, instead of just finding a single best model. Earlier studies have demonstrated how one can efficiently use (nearly) all the subnetworks of a single good network for prediction. This work, however, has not attempted to specifically search for a network, subnetworks of which would yield good predictions. We demonstrate how to find such a best set of nested networks as fast as finding a single best network using an enhanced version of the dynamic programming approach mentioned earlier. We also show that doing so is better than simply finding a single best network and then using its subnetworks for prediction. There is a previous algorithm that uses dynamic programming to find the single best Bayesian network structure when the goodness criterion for the structure satisfies so called decomposability requirement that allows the goodness of the network to be expressed as a sum of terms, one term per each node of the Bayesian network structure. Marginalizing over substructures also satisfies this decomposability criterion, but the individual terms may be very expensive to compute. We show that they can be computed in reasonable time using discrete zeta-transform.
Page 01 of 7
t st t tt srt s trs r rt
rr srt ts r r r t rts t srt trs t s srt s trs s r t s t t t rts s ss t tr tt s r s ss r sst ts t tr s tt rr t ts st t t t tt t tt rt ts sss t
r t s str t tr t r t strtr ts s r t t t st strtr s Pr r r t s ss rtr t s sts t r t t rss s s rr r rr sts t r rst sr rts r s
s s trs r rt rss t s t r s r s t ss s r st st s st rr sts strt...