Journal
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING
Volume 53, Issue 9, Pages 1305-1325Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ijar.2012.06.004
Keywords
Causality; Bayesian networks; Structure learning; Faithfulness
Categories
Funding
- Prognostics for Optimal Maintenance (POM) project [100031]
- Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen)
Ask authors/readers for more resources
This paper presents an extension to the Conservative PC algorithm which is able to detect violations of adjacency faithfulness under causal sufficiency and triangle faithfulness. Violations can be characterized by pseudo-independent relations and equivalent edges, both generating a pattern of conditional independencies that cannot be modeled faithfully. Both cases lead to uncertainty about specific parts of the skeleton of the causal graph. These ambiguities are modeled by an f-pattern. We prove that our Adjacency Conservative PC algorithm is able to correctly learn the f-pattern. We argue that the solution also applies for the finite sample case if we accept that only strong edges can be identified. Experiments based on simulations and the ALARM benchmark model show that the rate of false edge removals is significantly reduced, at the expense of uncertainty on the skeleton and a higher sensitivity for accidental correlations. (C) 2012 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available