On the classes of causal networks, identifiable by simple independence tests

• Опубліковано в: PROBLEMS IN PROGRAMMING
• Дата: 2018
• Випуск: 2-3
• Сторінки: 180-188
• ISSN: 1727-4907
• Автори та афіліації: O.S. Balabanov — Institute of Software Systems NAS of Ukraine — ORCID: 0000-0001-9141-9074
• Автор: Balabanov, O.S.
• Формат: Стаття
• Мова: Українська
• Опубліковано: PROBLEMS IN PROGRAMMING 2018
• Теми: causal network; 1-identifiable model; unconditional independence; conditional independence of 1st rank; locally minimal separator; collider; cycle; chain; d-separation; poly-tree; edge triangle; UDC 004.855:519.216
• Онлайн доступ: https://pp.isofts.kiev.ua/index.php/ojs1/article/view/281
• Назва журналу: Problems in programming

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