Authors
Peter Spirtes
Carnegie Mellon University
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
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 59,775
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

Analytics

Added to PP index
2010-12-22

Total views
42 ( #247,346 of 2,432,667 )

Recent downloads (6 months)
1 ( #464,745 of 2,432,667 )

How can I increase my downloads?

Downloads

My notes