|Abstract||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)|
|Categories||No categories specified (fix it)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Peter Spirtes (2005). Graphical Models, Causal Inference, and Econometric Models. Journal of Economic Methodology 12 (1):3-34.
J. C. E. Dekker (1981). Twilight Graphs. Journal of Symbolic Logic 46 (3):539-571.
James F. Lynch (1997). Infinitary Logics and Very Sparse Random Graphs. Journal of Symbolic Logic 62 (2):609-623.
Jiji Zhang & Peter Spirtes, A Transformational Characterization of Markov Equivalence for Directed Maximal Ancestral Graphs.
Peter Spirtes, A Polynomial Time Algorithm for Determining Dag Equivalence in the Presence of Latent Variables and Selection Bias.
Peter Turney (1989). The Architecture of Complexity: A New Blueprint. Synthese 79 (3):515 - 542.
Jonathan Schaffer (2004). Two Conceptions of Sparse Properties. Pacific Philosophical Quarterly 85 (1):92–102.
Brenda J. Latka (1994). Finitely Constrained Classes of Homogeneous Directed Graphs. Journal of Symbolic Logic 59 (1):124-139.
Added to index2010-12-22
Total downloads3 ( #202,056 of 549,130 )
Recent downloads (6 months)1 ( #63,397 of 549,130 )
How can I increase my downloads?