Partition MCMC for Inference on Acyclic Digraphs

Journal of the American Statistical Association

Volumn 112, Issue 517, 2017, Pages 282-299

  Kuipers, Jack ^a   Moffa, Giusi ^b  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

Bayesian networks; MCMC; Structure learning

Indexed keywords

EID: 85019023792     PISSN: 01621459     EISSN: 1537274X     Source Type: Journal    
DOI: 10.1080/01621459.2015.1133426     Document Type: Article

References (57)

1. Alon, I., and Rodeh, M., (1978), “Finding a Minimum Circuit in a Graph,” SIAM Journal on Computing, 7, 413–423.
2. Andersson, S. A., Madigan, D., and Perlman, M. D., (1997), “A Characterization of Markov Equivalence Classes for Acyclic Digraphs,” Annals of Statistics, 25, 505–541.
3. Breiman, L., (1996), “Bagging Predictors,” Machine Learning, 24, 123–140.
4. Colombo, D., and Maathuis, M. H., (2014), “Order-Independent Constraint-Based Causal Structure Learning,” Journal of Machine Learning Research, 15, 3741–3782.
5. Consonni, G., and Rocca, L. L., (2012), “Objective Bayes Factors for Gaussian Directed Acyclic Graphical Models,” Scandinavian Journal of Statistics, 39, 743–756.
6. Cooper, G. F., and Yoo, C., (1999), “Causal Discovery From a Mixture of Experimental and Observational Data,” in Fifteenth Conference on Uncertainty in Artificial Intelligence, pp. 116–125.
7. Cowell, R. G., Dawid, P., Lauritzen, S. L., and Spiegelhalter, D. J., (2007), Probabilistic Networks and Expert Systems, New York:Springer.
8. Daly, R., Shen, Q., and Aitken, S., (2011), “Learning Bayesian Networks:Approaches and Issues,” The Knowledge Engineering Review, 26, 99–157.
9. Dawid, A. P., (2010), “Beware of the DAG!” Journal of Machine Learning Research Workshop and Conference Proceedings, 6, 59–86.
10. Eaton, D., and Murphy, K., (2007a), “Bayesian Structure Learning Using Dynamic Programming and MCMC,” in Twenty-Third Conference on Uncertainty in Artificial Intelligence, pp. 101–108.
11. Eaton, D., and Murphy, K. (2007b), “BDAGL,” available at http://www.cs.ubc.ca/murphyk/Software/BDAGL/.
12. Efron, B., (1979), “Bootstrap Methods:Another Look at the Jackknife,” Annals of Statistics, 7, 1–26.
13. Elidan, G., (2011), “Bagged Structure Learning of Bayesian Network,” in International Conference on Artificial Intelligence and Statistics, pp. 251–259.
14. Ellis, B., and Wong, W. H., (2008), “Learning Causal Bayesian Network Structures From Experimental Data,” Journal of the American Statistical Association, 103, 778–789.
15. Friedman, N., (2004), “Inferring Cellular Networks Using Probabilistic Graphical Models,” Science, 303, 799–805.
16. Friedman, N., Goldszmidt, M., and Wyner, A., (1999), “Data Analysis With Bayesian Networks:A Bootstrap Approach,” in Fifteenth Conference on Uncertainty in Artificial Intelligence, pp. 196–205.
17. Friedman, N., and Koller, D., (2003), “Being Bayesian About Network Structure. A Bayesian Approach to Structure Discovery in Bayesian Networks,” Machine Learning, 50, 95–125.
18. Friedman, N., Linial, M., Nachman, I., and Pe’er, D., (2000), “Using Bayesian Networks to Analyze Expression Data,” Journal of Computational Biology, 7, 601–620.
19. Geiger, D., and Heckerman, D., (1994), “Learning Gaussian Networks,” in Tenth Conference on Uncertainty in Artificial Intelligence, pp. 235–243.
20. Geiger, D., and Heckerman, D. (2002), “Parameter Priors for Directed Acyclic Graphical Models and the Characterization of Several Probability Distributions,” Annals of Statistics, 30, 1412–1440.
21. Giudici, P., and Castelo, R., (2003), “Improving Markov Chain Monte Carlo Model Search for Data Mining,” Machine Learning, 50, 127–158.
22. Grzegorczyk, M., and Husmeier, D., (2008), “Improving the Structure MCMC Sampler for Bayesian Networks by Introducing a New Edge Reversal Move,” Machine Learning, 71, 265–305.
23. Hauser, A., and Bühlmann, P., (2015), “Jointly Interventional and Observational Data:Estimation of Interventional Markov Equivalence Classes of Directed Acyclic Graphs,” Journal of the Royal Statistical Society, Series B, 77, 291–318.
24. He, R., Tian, J., and Wu, H., (2015), “Structure Learning in Bayesian Networks of Moderate Size By Efficient Sampling,” ArXiv:1501.04370.
25. He, Y., Jia, J., and Yu, B., (2013), “Reversible MCMC on Markov Equivalence Classes of Sparse Directed Acyclic Graphs,” Annals of Statistics, 41, 1742–1779.
26. Heckerman, D., and Geiger, D., (1995), “Learning Bayesian Networks:A Unification for Discrete and Gaussian Domains,” in Eleventh Conference on Uncertainty in Artificial Intelligence, pp. 274–284.
27. Hill, S. M., Lu, Y., Molina, J., Heiserand, L. M., Spellman, P. T., Speed, T. P., Gray, J. W., Mills, G. B., and Mukherjee, S., (2012), “Bayesian Inference of Signaling Network Topology in a Cancer Cell Line,” Bioinformatics, 28, 2804–2810.
28. Husmeier, D., (2003), “Sensitivity and Specificity of Inferring Genetic Regulatory Interactions From Microarray Experiments With Dynamic Bayesian Networks,” Bioinformatics, 19, 2271–2282.
29. Kalisch, M., and Bühlmann, P., (2007), “Estimating High-Dimensional Directed Acyclic Graphs With the PC-Algorithm,” Journal of Machine Learning Research, 8, 613–636.
30. Kalisch, M., Mächler, M., Colombo, D., Maathuis, M. H., and Bühlmann, P., (2012), “Causal Inference Using Graphical Models With the R Package Pcalg,” Journal of Statistical Software, 47, 1–26.
31. Koivisto, M., and Sood, K., (2004), “Exact Bayesian Structure Discovery in Bayesian Networks,” Journal of Machine Learning Research, 5, 549–573.
32. Koller, D., and Friedman, N., (2009), Probabilistic Graphical Models, Cambridge, MA:MIT Press.
33. Kuipers, J., and Moffa, G., (2015), “Uniform Random Generation of Large Acyclic Digraphs,” Statistics and Computing, 25, 227–242.
34. Kuipers, J., Moffa, G., and Heckerman, D., (2014), “Addendum on the Scoring of Gaussian Directed Acyclic Graphical Models,” Annals of Statistics, 42, 1689–1691.
35. Lichman, M., (2013), “UCI Machine Learning Repository,” available at http://archive.ics.uci.edu/ml.
36. Link, W. A., and Eaton, M. J., (2012), “On Thinning of Chains in MCMC,” Methods in Ecology and Evolution, 3, 112–115.
37. Maathuis, M. H., Kalisch, M., and Bühlmann, P., (2009), “Estimating High-Dimensional Intervention Effects From Observational Data,” Annals of Statistics, 37, 3133–3164.
38. Madigan, D., Andersson, S. A., Perlman, M. D., and Volinsky, C. T., (1996), “Bayesian Model Averaging and Model Selection for Markov Equivalence Classes of Acyclic Digraphs,” Communications in Statistics — Theory and Methods, 25, 2493–2519.
39. Madigan, D., and York, J., (1995), “Bayesian Graphical Models for Discrete Data,” International Statistical Review, 63, 215–232.
40. Melançon, G., Dutour, I., and Bousquet-Mélou, M., (2001), “Random Generation of Directed Acyclic Graphs,” Electronic Notes in Discrete Mathematics, 10, 202–207.
41. Melançon, G., and Philippe, F., (2004), “Generating Connected Acyclic Digraphs Uniformly at Random,” Information Processing Letters, 90, 209–213.
42. Mukherjee, S., and Speed, T. P., (2008), “Network Inference Using Informative Priors,” Proceedings of the National Academy of Sciences, 105, 14313–14318.
43. Niinimäki, T., Parviainen, P., and Koivisto, M., (2011), “Partial Order MCMC for Structure Discovery in Bayesian Networks,” in Twenty-seventh Conference on Uncertainty in Artificial Intelligence, pp. 557–564.
44. Pearl, J., (2000), Causality:Models, Reasoning and Inference, Cambridge, MA:MIT Press.
45. Pearl, J., and Verma, T. S., (1991), “A Theory of Inferred Causation,” in Second International Conference on Principles of Knowledge Representation and Reasoning, pp. 441–452.
46. Peña, J. M., (2007), “Approximate Counting of Graphical Models via MCMC,” in Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, pp. 352–359.
47. Peters, J., and Bühlmann, P., (2015), “Structural Intervention Distance (SID) for Evaluating Causal Graphs,” Neural Computation, 27, 771–799.
48. Rau, A., Jaffrézic, F., Foulley, J.-L., and Doerge, R. W., (2012), “Reverse Engineering Gene Regulatory Networks Using Approximate Bayesian Computation,” Statistics and Computing, 22, 1257–1271.
49. Robinson, R. W., (1970), “Enumeration of Acyclic Digraphs,” in Second Chapel Hill Conference on Combinatorial Mathematics and Its Applications, pp. 391–399.
50. Robinson, R. W., (1973), “Counting Labeled Acyclic Digraphs,” in New Directions in the Theory of Graphs, ed. F. Harary, New York:Academic Press, pp. 239–273.
51. Sachs, K., Perez, O., Pe’er, D., Lauffenburger, D. A., and Nolan, G. P., (2005), “Causal Protein-Signaling Networks Derived From Multiparameter Single-Cell Data,” Science, 308, 523–529.
52. Scutari, M., (2010), “Learning Bayesian Networks With the bnlearn R Package,” Journal of Statistical Software, 35, 1–22.
53. Spirtes, P., Glymour, C. N., and Scheines, R., (2000), Causation, Prediction, and Search, Cambridge, MA:MIT Press.
54. Stanley, R. P., (1973), “Acyclic Orientations of Graphs,” Discrete Mathematics, 5, 171–178.
55. Tsamardinos, I., Brown, L. E., and Aliferis, C. F., (2006), “The Max-Min Hill-Climbing Bayesian Network Structure Learning Algorithm,” Machine Learning, 65, 31–78.
56. Verma, T. S., and Pearl, J., (1990), “Equivalence and Synthesis of Causal Models,” in Sixth Conference on Uncertainty in Artificial Intelligence, pp. 220–227.
57. Werhli, A. V., and Husmeier, D., (2007), “Reconstructing Gene Regulatory Networks with Bayesian Networks by Combining Expression Data With Multiple Sources of Prior Knowledge,” Statistical Applications in Genetics and Molecular Biology, 6, 1–47.