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: | Balabanov, O.S. |
| 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 programmingSimilar Items
-
Causal inference from data. On some inadequacy problems of structures with hidden causes
by: Balabanov, O.S.
Published: (2020) -
Knowledge discovery in data and causal models in analytical informatics
by: Balabanov, O.S.
Published: (2018) -
Principles and analytical tools for reconstruction of probabilistic dependency structures in special class
by: Balabanov, O.S.
Published: (2018) -
From temporal data to dynamic causal models
by: Balabanov, O.S.
Published: (2023) -
Big Data Analytics: principles, trends and tasks (a survey)
by: Balabanov, O.S.
Published: (2019)