On the classes of causal networks, identifiable by simple independence tests
We tackle some theoretical problems of constraint-based approach to causal network inference from data (without prior restrictions). Our interest is to recover a model structure from independence tests of zero and first rank only. Class of 1-identifiable causal structures is defined. An idea to reco...
Saved in:
| Date: | 2018 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
PROBLEMS IN PROGRAMMING
2018
|
| Subjects: | |
| Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/281 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems in programming |
| Download file: |  |
Institution
Problems in programming| Summary: | We tackle some theoretical problems of constraint-based approach to causal network inference from data (without prior restrictions). Our interest is to recover a model structure from independence tests of zero and first rank only. Class of 1-identifiable causal structures is defined. An idea to recognize whether model recovery is successfully completed (i.e. adequate model structure is outputted) is suggested. Theframework of locally minimal separation in DAG is shown to be appropriate instrument to tackle the problem. A few subclasses of class of 1-identifiable structures are specified; corresponding structural restrictions and criteria of recovery completeness are given. We present some causal structures which are not 1-identifiable.Problems in programming 2018; 2-3: 180-188 |
|---|