Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
Learning Bayesian Networks with Restricted Causal Interactions
Julian Neil, Chris Wallace, Kevin Korb
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.
Keywords: Bayesian networks, causal discovery, causal independence, log-linear models, Minimum
Pages: 486-493
PS Link:
PDF Link: /papers/99/p486-neil.pdf
AUTHOR = "Julian Neil and Chris Wallace and Kevin Korb",
TITLE = "Learning Bayesian Networks with Restricted Causal Interactions",
BOOKTITLE = "Proceedings of the Fifteenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-99)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "1999",
PAGES = "486--493"

hosted by DSL   •   site info   •   help