Learning Bayesian Networks with Restricted Causal Interactions
Not on the map. Why?
Abstract (arXiv)
A major problem for the learning of Bayesian networks (BNs) is the exponential number of parameters needed for conditional probability tables. Recent research reduces this complexity by modeling local structure in the probability tables. We examine the use of log-linear local models. While log-linear models in this context are not new (Whittaker, 1990; Buntine, 1991; Neal, 1992; Heckerman and Meek, 1997), for structure learning they are generally subsumed under a naive Bayes model. We describe an alternative interpretation, and use a Minimum Message Length (MML) (Wallace, 1987) metric for structure learning of networks exhibiting causal independence, which we term first-order networks (FONs). We also investigate local model selection on a node-by-node basis.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 23 Jan 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.
- 2021Markov Blanket Discovery using Minimum Message Lengthcited by 1
- 2021Markov Blanket Discovery using Minimum Message Length16 Jul 2021