Abstract

We consider a Bayesian method for learning the Bayesian network structure from complete data. Recently, Koivisto and Sood (2004) presented an algorithm that for any single edge computes its marginal posterior probability in O(n2 n) time, where n is the number of attributes; the number of parents per attribute is bounded by a constant. In this paper we show that the posterior probabilities for all the n(n−1) potential edges can be computed in O(n2 n) total time. This result is achieved by a forward–backward technique and fast Möbius transform algorithms, which are of independent interest. The resulting speedup by a factor of about n 2 allows us to experimentally study the statistical power of learning moderate-size networks. We report results from a simulation study that covers data sets with 20 to 10,000 records over 5 to 25 discrete attributes. 1

Citations

3116	A tutorial on hidden Markov models and selected applications in speech recognition - Rabiner - 1989
2529	C.J.E.: Uci repository of machine learning databases, http://www.ics.uci.edu/ ∼ mlearn/MLRepository.html - Blake, Keogh
1128	Probability inequalities for sums of bounded random variables - Hoeffding - 1963
877	A Bayesian method for the induction of probabilistic networks from data - Cooper, Herskovits - 1992
766	Causality: Models, reasoning, and inference - Pearl - 2001
752	Learning Bayesian networks: the combination of knowledge and statistical data - Heckerman, Geiger, et al. - 1995
487	Approximating discrete probability distributions with dependence trees - Chow, Liu - 1968
229	Bucket elimination: a unifying framework for reasoning - Dechter - 1999
213	The generalized distributive law - Aji, Mceliece - 2000
166	Bayesian graphical models for discrete data - Madigan, York - 1995
156	Being Bayesian about network structure. a Bayesian approach to structure discovery in Bayesian networks - Friedman, Koller
153	Theory refinement on bayesian networks - Buntine - 1991
152	A Bayesian approach to learning Bayesian networks with local structure - Chickering, Heckerman, et al. - 1997
78	Sensitivity and specificity of inferring genetic regulatory interactions from microarray experiments with dynamic Bayesian networks - Husmeier - 2003
64	C: A Bayesian approach to causal discovery - Cooper, Heckerman, et al.
59	Learning bayesian networks: Search methods and experimental results - Chickering, Geiger, et al. - 1995
45	Learning bayesian network structures by searching for the best ordering with genetic algorithms - Larrañaga, Kuijpers, et al. - 1996
36	Properties of Bayesian belief network learning algorithms", IndeMantaras and Poole [160 - Bouckaert
33	On inclusion-driven learning of Bayesian networks - Castelo, Kocka - 2003
28	Learning and robust learning of product distributions - Höffgen - 1993
26	Dynamic programming treatment of the Travelling Salesman Problem - Bellman - 1962
23	Computer-based probabilistic network construction, Doctoral dissertation, Medical information sciences - Herskovits - 1991
22	The alarm monitoring system - Beinlich - 1989
21	B-course: A web-based tool for Bayesian and causal data analysis - Myllymki, Silander, et al. - 2002
14	Computational aspects of the Möbius transformation - Kennes, Smets - 1990
12	Searching for Bayesian network structures in the space of restricted acyclic partially directed graphs - Acid, Campos - 2003
11	Sum-Product Algorithms for the Analysis of Genetic Risks - Koivisto - 2004
1	Optimal structure indentification with greedy search - Chickering