MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Learning Bayesian Networks From Dependency Networks: A Preliminary Study (2003) [3 citations — 0 self]

by Geoff Hulten ,  David Maxwell Chickering ,  David Heckerman
in Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics, Key West, FL
Add To MetaCart

Abstract:

In this paper we describe how to learn Bayesian networks from a summary of complete data in the form of a dependency network rather than from data directly. This method allows us to gain the advantages of both representations: scalable algorithms for learning dependency networks and convenient inference with Bayesian networks. Our approach is to use a dependency network as an "oracle" for the statistics needed to learn a Bayesian network. We show that the general problem is NP-hard and develop a greedy search algorithm. We conduct a preliminary experimental evaluation and find that the prediction accuracy of the Bayesian networks constructed from our algorithm almost equals that of Bayesian networks learned directly from the data.

Citations

6139 Introduction to algorithms – Cormen, Rivest - 2000
870 Reducibility among combinatorial problems – Karp
727 A bayesian method for the induction of probabilistic networks from data – Cooper, Hersovits - 1992
465 An introduction to variational methods for graphical models – Jordan, Ghahramani, et al. - 1999
258 M.: Loopy belief propagation for approximate inference: An empirical study – Murphy, Weiss, et al. - 1999
221 Learning Bayesian Networks – Heckerman, Geiger, et al. - 1994
175 Mining High-Speed Data Streams – Domingos, Hulten - 2000
134 A guide to the literature on learning probabilistic networks from data – Buntine - 1996
102 Learning of Bayesian network structure from massive datasets: The “sparse candidate” algorithm – Friedman, Nachman, et al. - 1999
75 Dependency networks for inference, collaborative filtering, and data visualization – Heckerman, Chickering, et al.
22 Mining complex models from arbitrarily large databases in constant time – Hulten, Domingos - 2002
10 A dynamic adaptation of AD-trees for efficient machine learning on large data sets – Komarek, Moore - 2000
2 Learning in Graphical Models, volume 89 – Jordan, editor - 1998
1 A dynamic adaptation of AD-trees for e#cient machine learning on large data sets – Komarek, Moore - 2000
1 belief propagation for approximate inference: an empirical study – Loopy - 1999