Previous asymptotically correct algorithms for recovering causal structure from sample probabilities have been limited even in sparse graphs to a few variables. We describe an asymptotically correct algorithm whose complexity for fixed graph connectivity increases polynomially in the number of vertices, and may in practice recover sparse graphs with several hundred variables. From..
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
References found in this work BETA
No references found.
Citations of this work BETA
Detection of Unfaithfulness and Robust Causal Inference.Jiji Zhang & Peter Spirtes - 2008 - Minds and Machines 18 (2):239-271.
Jon Williamson Bayesian Nets and Causality.Clark Glymour - 2009 - British Journal for the Philosophy of Science 60 (4):849-855.
Response to Glymour. [REVIEW]Jon Williamson - 2009 - British Journal for the Philosophy of Science 60 (4):857-860.
Similar books and articles
Graphical Models, Causal Inference, and Econometric Models.Peter Spirtes - 2005 - Journal of Economic Methodology 12 (1):3-34.
Infinitary Logics and Very Sparse Random Graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
A Transformational Characterization of Markov Equivalence for Directed Maximal Ancestral Graphs.Jiji Zhang & Peter Spirtes - unknown
A Polynomial Time Algorithm for Determining Dag Equivalence in the Presence of Latent Variables and Selection Bias.Peter Spirtes - unknown
Finitely Constrained Classes of Homogeneous Directed Graphs.Brenda J. Latka - 1994 - Journal of Symbolic Logic 59 (1):124-139.
Added to index2010-12-22
Total downloads18 ( #265,996 of 2,154,061 )
Recent downloads (6 months)2 ( #279,759 of 2,154,061 )
How can I increase my downloads?