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...

Full description

Saved in:
Bibliographic Details
Published in:PROBLEMS IN PROGRAMMING
Date:2018
Issue:2-3
Pages:180-188
ISSN:1727-4907
Author Affiliations:
  • O.S. Balabanov — Institute of Software Systems NAS of Ukraine — ORCID: 0000-0001-9141-9074
Keywords:умовна незалежність 1-го рангу, умовна незалежність, локальномінімальний сепаратор, d-сепарація, безумовна незалежність, колізор, каузальна мережа, ланцюг, ланцюжок, каузальні моделі
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: Pdf

Institution

Problems in programming