An Algorithm for Fast Recovery of Sparse Causal Graphs

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
(categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,188
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
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.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2010-12-22

Total downloads

18 ( #265,996 of 2,154,061 )

Recent downloads (6 months)

2 ( #279,759 of 2,154,061 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums