Experiment selection for causal discovery

Journal of Machine Learning Research

Volumn 14, Issue , 2013, Pages 3041-3071

  Hyttinen, Antti ^a   Eberhardt, Frederick ^b   Hoyer, Patrik O ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CAUSAL RELATIONSHIPS; COMBINATORICS; CONTROLLED EXPERIMENT; EXPLICIT CONSTRUCTIONS; IDENTIFIABILITY; OPTIMAL SETS; QUANTITIES OF INTERESTS;

COMBINATORIAL MATHEMATICS; OPTIMIZATION;

EXPERIMENTS;

EID: 84887501199     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (52)

1. N. Alon, B. Bollobas, A. Gyarfas, J. Lehel, and A. Scott. Maximum directed cuts in acyclic digraphs. Journal of Graph Theory, 55(1):1-13, 2007 (Pubitemid 46726065)
2. E. Bareinboim and J. Pearl. In Proceedings of the Twenty-Eight Conference on Uncertainty in Artificial Intelligence, 2012
3. M. Bussieck. The minimal cut cover of a graph. Technical Report TR-94-02, Pennsylvania State University, 1994
4. M.-C. Cai. On separating systems of graphs. Discrete Mathematics, 49(1):15 - 20, 1984a.
5. M.-C. Cai. On a problem of Katona on minimal completely separating systems with restrictions. Discrete Mathematics, 48(1):121-123, 1984b
6. P. J. Cameron. Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press, 1994
7. T. Claassen and T. Heskes. Causal discovery in multiple models from different experiments. In Advances in Neural Information Processing Systems 23, pages 415-423, 2010
8. G. Cooper and C. Yoo. Causal discovery from a mixture of experimental and observational data. In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, 1999
9. T. J. Dickson. On a problem concerning separating systems of a finite set. Journal of Combinatorial Theory, 7(3):191-196, 1969
10. D. Eaton and K. Murphy. Exact Bayesian structure learning from uncertain interventions. In Proceedings of the 11th International Conference on Artificial Intelligence and Statistics, Journal of Machine Learning Research Workshop and Conference Proceedings 2, 2007
11. F. Eberhardt. Causation and Intervention. PhD thesis, Carnegie Mellon, 2007
12. F. Eberhardt. Almost optimal intervention sets for causal discovery. In Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence. AUAI Press, 2008
13. F. Eberhardt, C. Glymour, and R. Scheines. On the number of experiments sufficient and in the worst case necessary to identify all causal relations among n variables. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence. AUAI Press, 2005
14. F. Eberhardt, P. O. Hoyer, and R. Scheines. Combining experiments to discover linear cyclic models with latent variables. In Proceedings of the 13th International Conference on Artificial Intelligence and Statistics, Journal of Machine Learning Research Workshop and Conference Proceedings 9, 2010
15. R. A. Fisher. The Design of Experiments. Hafner, 1935
16. J. R. Griggs, Sven Hartman, Uwe Leck, and I. T. Roberts. Full and maximal squashed flat antichains of minimum weight. Technical report, 2012
17. B. Halldorsson,M. Halldorsson, and R. Ravi. On the approximability of the minimumtest collection problem. In Friedhelm auf der Heide, editor, Algorithms ESA 2001, volume 2161 of Lecture Notes in Computer Science, pages 158-169
18. M. Halldorsson. A still better performance guarantee for approximate graph coloring. Information Processing Letters, 45(1):19-23, 1993 (Pubitemid 23639500)
19. A. Hauser and P. Buhlmann. Two optimal strategies for active learning of causal models from interventions. In Proceedings of the 6th European Workshop on Probabilistic Graphical Models, 2012
20. Y.-B. He and Z. Geng. Active learning of causal networks with intervention experiments and optimal designs. Journal of Machine Learning Research, 9:2523-2547, 2008
21. A. Hyttinen, F. Eberhardt, and P. O. Hoyer. Causal discovery for linear cyclic models with latent variables. In Proceedings of the Fifth European Workshop on Probabilistic Graphical Models, 2010
22. A. Hyttinen, F. Eberhardt, and P. O. Hoyer. Noisy-or models with latent confounding. In Proceedings of the Twenty-Seventh Conference Conference on Uncertainty in Artificial Intelligence, 2011
23. A. Hyttinen, F. Eberhardt, and P. O. Hoyer. Causal discovery of linear cyclic models from multiple experimental data sets with overlapping variables. In Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence, 2012a
24. A. Hyttinen, F. Eberhardt, and P. O. Hoyer. Learning linear cyclic causal models with latent variables. Journal of Machine Learning Research, 13:3387-3439, 2012b.
25. S. Jukna. Extremal Combinatorics. Springer, 2011
26. G. Katona. On separating systems of a finite set. Journal of Combinatorial Theory, 1(2):174-194, 1966
27. G. Katona. A theorem of finite sets. In P. Erdos and G. Katona, editors, Theory of graphs. Akademiai Kiado and Academic Press, 1968. A. Kisv olcsey. Flattening antichains. Combinatorica, 26:65-82, 2006
28. D.J. Kleitman and E.C. Milner. On the average size of the sets in a Sperner family. Discrete Mathematics, 6(2):141-147, 1973
29. J. B. Kruskal. The number of simplices in a complex. In R. Bellman, editor, Mathematical Optimization Techniques. University of California Press, 1963
30. A. Kundgen, D. Mubayi, and P. Tetali. Minimal completely separating systems of k-sets. Journal of Combinatorial Theory, Series A, 93(1):192-198, 2001 (Pubitemid 33630974)
31. L. Liberti, L. Alfandari, and M.-C. Plateau. Edge cover by connected bipartite subgraphs. Annals of Operations Research, 188:307-329, 2011
32. P. Lieby. The separation problem. Honours thesis, Northern Territory University, 1994
33. P. Lieby. Extremal Problems in Finite Sets. PhD thesis, Northern Territory University, 1999
34. R. Loulou. Minimal cut cover of a graph with an application to the testing of electronic boards. Operations Research Letters, 12(5):301-305, 1992
35. S. Meganck, B. Manderick, and P. Leray. A decision theoretic approach to learning Bayesian networks. Technical report, Vrije Universiteit Brussels, 2005
36. B. M. E. Moret and H. D. Shapiro. On minimizing a set of tests. SIAM Journal on Scientific and Statistical Computing, 6(4):983-1003, 1985
37. R. Motwani and J. Naor. On exact and approximate cut covers of graphs. Technical report, Stanford University, 1993
38. K. P. Murphy. Active learning of causal Bayes net structure. Technical report, U.C. Berkeley, 2001
39. J. Pearl. Causality. Oxford University Press, 2000
40. C. Ramsay and I. T. Roberts. Minimal completely separating systems of sets. Australasian Journal of Combinatorics, 13:129-150, 1996 (Pubitemid 126054678)
41. C. Ramsay, I. T. Roberts, and F. Ruskey. Completely separating systems of k-sets. Discrete Mathematics, 183:265-275, 1998 (Pubitemid 128387383)
42. A. Renyi. On random generating elements of a finite Boolean algebra. Acta Sci. Math. (Szeged), 22:75-81, 1961
43. I. T. Roberts. The flat antichain conjecture for small average set size. Technical report, Northern Territory University, 1999
44. I. T. Roberts and Leanne J. Rylands. Minimal (n) and (n,h,k) completely separating systems. Australasian Journal of Combinatorics, 33:57-66, 2005
45. I. Shpitser and J. Pearl. In Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence, 2006
46. J. Spencer. Minimal completely separating systems. Journal of Combinatorial Theory, 8(4):446-447, 1970
47. E. Sperner. Ein Satz uber Untermengen einer endlichen Menge. Mathematische Zeitschrift, 27: 544-548, 1928
48. P. Spirtes, C. Glymour, and R. Scheines. Causation, Prediction and Search. MIT Press, 1993
49. S. Tong and D. Koller. Active learning for structure in Bayesian networks. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, 2001
50. K. Watanabe, M. Sengoku, H. Tamura, K. Nakano, and S. Shinoda. A scheduling problem in multihop networks. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E83-A(6):1222-1227, 2000
51. I. Wegener. On separating systems whose elements are sets of at most k elements. Discrete Mathematics, 28(2):219-222, 1979
52. D. J. A. Welsh and M. B. Powell. An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal, 10(1):85-86, 1967