Learning Causal Graphs with Latent Confounders in Weak Faithfulness Violations

详细信息    查看全文

• 作者：Takashi Isozaki ; Manabu Kuroki
• 关键词：Causal models ; Causal discovery ; Latent variables ; Maximal ancestral graphs ; Causal faithfulness condition
• 刊名：New Generation Computing
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：35
• 期：1
• 页码：29-45
• 全文大小：
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence (incl. Robotics); Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Computing Methodologies;
• 出版者：Ohmsha
• ISSN：1882-7055
• 卷排序：35

文摘

Learning causal models hidden in the background of observational data has been a difficult issue. Dealing with latent common causes and selection bias for constructing causal models in real data is often necessary because observing all relevant variables is difficult. Ancestral graph models are effective and useful for representing causal models with some information of such latent variables. The causal faithfulness condition, which is usually assumed for determining the models, is known to often be weakly violated in statistical view points for finite data. One of the authors developed a constraint-based causal learning algorithm that is robust against the weak violations while assuming no latent variables. In this study, we applied and extended the thoughts of the algorithm to the inference of ancestral graph models. The practical validity and effectiveness of the algorithm are also confirmed by using some standard datasets in comparison with FCI and RFCI algorithms.