Please note that eDoc will be permanently shut down in the first quarter of 2021!      Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Intelligente Systeme (ehemals Max-Planck-Institut für Metallforschung)     Collection: Abt. Schölkopf (Empirical Inference)     Display Documents



  history
ID: 596813.0, MPI für Intelligente Systeme (ehemals Max-Planck-Institut für Metallforschung) / Abt. Schölkopf (Empirical Inference)
Identifiability of causal graphs using functional models
Authors:Peters, J.; Mooij, J.; Janzing, D.; Schölkopf, B.
Place of Publication:Barcelona, Spain
Date of Publication (YYYY-MM-DD):2011-07-01
Title of Proceedings:27th Conference on Uncertainty in Artificial Intelligence (UAI 2011)
Start Page:589
End Page:598
Physical Description:9
Review Status:not specified
Audience:Not Specified
Intended Educational Use:No
Abstract / Description:This work addresses the following question: Under what assumptions on the data generating process can one infer the causal graph from the joint distribution? The approach
taken by conditional independencebased causal discovery methods is based on two assumptions: the Markov condition and faithfulness. It has been shown that under these assumptions the causal graph can be identified up to Markov equivalence (some arrows remain undirected) using methods like the PC algorithm. In this work we propose an alternative by Identifiable Functional Model Classes (IFMOCs). As our main theorem we prove that if the data generating process belongs to an IFMOC, one can identify the complete causal graph. To the best of our knowledge this is the first identifiability result of this kind that is not limited to linear functional relationships. We discuss
how the IFMOC assumption and the Markov and faithfulness assumptions relate to each other and explain why we believe that the IFMOC assumption can be tested more easily on given data. We further provide a practical algorithm that recovers the causal graph from finitely many data; experiments on simulated data support the theoretical fndings.
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Heide Klooz
Affiliations:MPI für Intelligente Systeme/Abt. Schölkopf
Identifiers:URL:http://www.kyb.tuebingen.mpg.de/fileadmin/user_upl...
LOCALID:PetersMJS2011
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.