On inclusion-driven learning of Bayesian networks

Journal of Machine Learning Research

Volumn 4, Issue 4, 2004, Pages 527-574

  Castelo, Robert ^a   Kočka, Tomáš ^b,c  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b AALBORG UNIVERSITY   (Denmark)

^c UNIVERSITY OF ECONOMICS   (Czech Republic)

Author keywords

Bayesian networks; Graphical Markov model inclusion; Inclusion boundary; Structure learning

Indexed keywords

ALGORITHMS; GRAPH THEORY; MARKOV PROCESSES; PROBABILITY; SET THEORY;

BAYESIAN NETWORKS; GRAPHICAL MARKOV MODEL INCLUSION; INCLUSION BOUNDARY; STRUCTURE LEARNING;

LEARNING SYSTEMS;

EID: 2542465947     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: 10.1162/153244304773936045     Document Type: Conference Paper

References (54)

1. S. Andersson, D. Madigan, and M. Perlman. A characterization of Markov equivalence classes for acyclic digraphs. Annals of Statistics, 25:505-541, 1997a.
2. S. Andersson, D. Madigan, and M. Perlman. On the Markov equivalence of chain graphs, undirected graphs, and acyclic digraphs. Scandinavian Journal of Statistics, 24:81-102, 1997b.
3. S. Andersson, D. Madigan, M. Perlman, and C. Triggs. On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs. Journal of Statistical Planning and Inference, 48:25-46, 1995.
4. I. Beinlich, H. Suermondt, R. Chavez, and G. Cooper. The alarm monitoring system: A case study with two probabilistic inference techniques for belief networks. In J. Hunter, editor, Proc. of the Second European Conference on Artificial Intelligence in Medicine, pages 247-256. Springer-Verlag, 1989.
5. R. Bouckaert. Optimizing causal orderings for generating dags from data. In D. Dubois, M.P. Wellman, B. D'Ambrosio, and P. Smets, editors, Proc. of the Conf. on Uncertainty in Artificial Intelligence, pages 9-16. Morgan Kaufmann, 1992.
6. J.S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In G.F. Cooper and S. Moral, editors, Proc. of the Conf. on Uncertainty in Artificial Intelligence, pages 43-52. Morgan Kaufmann, 1998.
7. W. Buntine. Theory refinement on Bayesian networks. In P. Smets B. D'Ambrosio and P.P. Bonissone, editors, Proc. of the Conf. on Uncertainty in Artificial Intelligence, pages 52-60. Morgan Kaufmann, 1991.
8. R. Castelo, A. Feelders, and A. Siebes. Mambo: Discovering association rules based on conditional independencies. In F. Hoffmann, D.J. Hand, N.M. Adams, D. Fisher, and G. Guimarães, editors, Proceedings 4th Symposium on Intelligent Data Analysis, volume 2189 of Lecture Notes in Computer Science, pages 289-298. Springer, 2001.
9. R. Castelo and M.D. Perlman. Learning essential graph Markov models from data. In J.A. Gámez and A. Salmerón, editors, First European Workshop on Probabilistic Graphical Models, pages 17-24, November 2002.
10. S. Chib and E. Greenberg. Understanding the Metropolis-Hastings algorithm. American Statistician, 49(4):327-335, 1995.
11. D.M. Chickering. A transformational characterization of equivalent Bayesian networks. In P. Besnard and S. Hanks, editors, Proc. of the Conf. on Uncertainty in Artificial Intelligence, pages 87-98. Morgan Kaufmann, 1995.
12. D.M. Chickering. Learning equivalence classes of Bayesian network structures. In E. Horvitz and F. Jensen, editors, Proc. of the Conf. on Uncertainty in Artificial Intelligence, pages 150-157. Morgan Kaufmann, 1996.
13. D.M. Chickering. Learning equivalence classes of Bayesian-network structures. Journal of Machine Learning Research, 2:445-498, 2002a.
14. D.M. Chickering. Optimal structure identification with greedy search. Journal of Machine Learning Research, 3:507-554, 2002b.
15. D.M. Chickering, D. Geiger, and D. Heckerman. Learning Bayesian networks: Search methods and experimental results. In D. Fisher and H-J. Lenz, editors, Proc. of the Intl. Workshop on Artificial Intelligence and Statistics, pages 112-128, 1995.
16. K.L. Chung. Markov Chains with Stationary Transition Probabilities (2nd ed). Springer-Verlag, 1967.
17. G. Cooper and E.H. Herskovits. A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9:309-405, 1992.
18. A.P. Dawid. Conditional independence in statistical theory (with discussion). Journal of the Royal Statistical Society B, 41(1):1-31, 1979.
19. D. Draper. Assessment and propagation of model uncertainty. Journal of the Royal Statistical Society B, 57:45-97, 1995.
20. D. Edwards and T. Havránek. A fast procedure for model search in multidimensional contingency tables. Biometrika, 72(2):339-351, 1985.
21. L. Fahrmeir. Multivariate Statistical Modelling Based on Generalized Linear Models. Springer-Verlag, New York, 1994.
22. N. Friedman and D. Koller. Being Bayesian about network structure. In C. Boutilier and M. Goldszmidt, editors, Proc. of the Conf. on Uncertainty in Artificial Intelligence, pages 201-210. Morgan Kaufmann, 2000.
23. M. Frydenberg. The chain graph Markov property. Scandinavian Journal of Statistics, 17: 333-353, 1990.
24. S. Gillispie and M. Perlman. Enumerating Markov equivalence classes of acyclic digraph models. In J. Breese and D. Koller, editors, Proc. of the Conf. on Uncertainty in Artificial Intelligence, pages 171-177. Morgan Kaufmann, 2001.
25. P. Giudici and R. Castelo. Association models for Web Mining. Journal of Data Mining and Knowledge Discovery, 24(1):39-57, 2001.
26. P. Giudici and R. Castelo. Improving Markov Chain Monte Carlo model search for Data Mining. Machine Learning, 50(1/2):127-158, 2003.
27. P. Giudici and P.J. Green. Decomposable graphical gaussian model determination. Biometrika, 86(4):785-801, 1999.
28. W.K. Hastings. Monte carlo sampling methods using Markov chains and their applications. Biometrika, 57(1):97-109, 1970.
29. T. Havránek. A procedure for model search in multidimensional contingency tables. Biometrics, 40:95-100, 1984.
30. D. Heckerman, D. Geiger, and D.M. Chickering. Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20:194-243, 1995.
31. E.H. Herskovits. Computer-Based Probabilistic Network Construction. PhD thesis, Medical Information Sciences, Stanford University, 1991.
32. J.S. Ide and F.G. Cozman. Random generation of Bayesian networks. In G. Bittencourt, editor, Proc. of the Brazilian Symposium on Artificial Intelligence, pages 366-375. Springer-Verlag, 2002.
33. R.E. Kass and A.E. Raftery. Bayes factors, Journal of the American Statistical Association, 90(430) :773-795, 1995.
34. T. Kočka. Graphical models - learning and applications. PhD thesis, University of Prague, 2001.
35. T. Kočka, R. Bouckaert, and M. Studený. On characterizing inclusion of Bayesian networks, In J. Breese and D. Koller, editors, Proc. of the Conf. on Uncertainty in Artificial Intelligence, pages 261-268. Morgan Kaufmann, 2001.
36. T. Kočka and R. Castelo. Improved learning of Bayesian networks. In J. Breese and D. Koller, editors, Proc. of the Conf. on Uncertainty in Artificial Intelligence, pages 269-276. Morgan Kaufmann, 2001.
37. P. Larrañaga, C. Kuijpers, R. Murga, and Y. Yurramendi. Learning Bayesian network structures by searching for the best ordering with genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics, 26(4):487-493, 1996.
38. S.L. Lauritzen. Graphical Models. Oxford University Press, Oxford, 1996.
39. S.L. Lauritzen, A.P. Dawid, B.N. Larsen, and H.G. Leimer. Independence properties of directed Markov fields. Networks, 20:491-505, 1990.
40. D. Madigan, S.A. Andersson, M. Perlman, and C.T. Volinsky. Bayesian model averaging and model selection for Markov equivalence classes of acyclic digraphs. Communications in Statistics (theory and methods), 25(11):2493-2512, 1996.
41. D. Madigan and J. York. Bayesian graphical models for discrete data. International Statistical Review, 63:215-232, 1995.
42. C. Meek. Graphical models, selecting causal and statistical models. PhD thesis, Carnegie Mellon University, 1997.
43. G. Melançon, I. Dutour, and M. Bousquet-Melou. Random generation of DAGs for graphs drawing. Technical report, Centrum voor Wiskunde en Informatica, February 2000.
44. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller. Equations of state calculations by fast computing machines. Journal of Chemical Physics, 21:1087-1092, 1953.
45. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Mateo, California, 1988.
46. J. Pearl and T. Verma. The logic of representing dependencies by directed graphs. In K. Forbus and H. Shrobe, editors, Proc. of the Conf. of the American Association of Artificial Intelligence, pages 374-379, 1987.
47. R.W. Robinson. Counting labeled acyclic digraphs. In F. Harary, editor, New Directions in the Theory of Graphs, pages 239-273. Academic Press, New York, 1973.
48. M. Singh and M. Valtorta. An algorithm for the construction of Bayesian network structures from data. In D. Heckerman and A. Mamdani, editors, Proc. of the Conf. on Uncertainty in Artificial Intelligence, pages 259-265. Morgan Kaufmann, 1993.
49. A.F.M. Smith and G.O. Roberts. Bayesian computation via the gibbs sampler and related Markov Chain Monte Carlo methods. Journal of the Royal Statistical Society B, 55(1): 3-23, 1993.
50. P. Spirtes, C. Glymour, and R. Scheimes. Causation, Prediction and Search. Springer-Verlag, New York, 1993.
51. P. Spirtes and C. Meek. Learning Bayesian networks with discrete variables from data. In U.M. Fayyad and R. Uthurusamy, editors, Proc. of the Intl. Conf. on Knowledge Discovery and Data Mining, pages 294-299. AAAI Press, 1995.
52. T.S. Verma and J. Pearl. Influence diagrams and d-separation. Technical report, Cognitive Systems Laboratory, UCLA, March 1988.
53. T.S. Verma and J. Pearl. Equivalence and synthesis of causal models. In P.P. Bonissone, M. Henrion, L.N. Kanal, and J.F. Lemmer, editors, Proc. of the Conf. on Uncertainty in Artificial Intelligence, pages 255-268. Morgan Kaufmann, 1990.
54. J. Whittaker. Graphical Models in Applied Multivariate Statistics. Wiley, New York, 1990.