TY - GEN
T1 - A Novel Causal Discovery Method in Linear SEM with Structure Priors
AU - Dang, Yinglong
AU - Gao, Xiaoguang
AU - Wang, Zidong
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - Causal discovery from observational data is a crucial but challenging task, and learning directed acyclic graphs (DAGs) is its foundation. The causal discovery method in linear structural equation models (SEMs) is one of the hot spots. However, almost all the existing methods have certain limitations, and an exact solution cannot always be identified. In this paper, a new heuristic algorithm for discovering causality was proposed, which provides a reasonable solution for combining structured priors or possible expert knowledge with heuristic search. We first identify the partial v-structures through partial correlation analysis as the structural priors of the following heuristic search algorithm. Second, through partial correlation analysis, we can also limit the search space we want to search for. Finally, to adapt to structural priors, an efficient particle swarm optimization (PSO) algorithm with an enhanced local search and a dynamic double-swarm strategy is proposed to improve the search capability. The experimental results demonstrate the effectiveness of the proposed methods when compared to the earlier state-of-the-art methods on six standard networks.
AB - Causal discovery from observational data is a crucial but challenging task, and learning directed acyclic graphs (DAGs) is its foundation. The causal discovery method in linear structural equation models (SEMs) is one of the hot spots. However, almost all the existing methods have certain limitations, and an exact solution cannot always be identified. In this paper, a new heuristic algorithm for discovering causality was proposed, which provides a reasonable solution for combining structured priors or possible expert knowledge with heuristic search. We first identify the partial v-structures through partial correlation analysis as the structural priors of the following heuristic search algorithm. Second, through partial correlation analysis, we can also limit the search space we want to search for. Finally, to adapt to structural priors, an efficient particle swarm optimization (PSO) algorithm with an enhanced local search and a dynamic double-swarm strategy is proposed to improve the search capability. The experimental results demonstrate the effectiveness of the proposed methods when compared to the earlier state-of-the-art methods on six standard networks.
KW - causal discovery
KW - partial correlation
KW - particle swarm optimization
KW - structural equation models
UR - http://www.scopus.com/inward/record.url?scp=85199891635&partnerID=8YFLogxK
U2 - 10.1109/ICCRE61448.2024.10589746
DO - 10.1109/ICCRE61448.2024.10589746
M3 - 会议稿件
AN - SCOPUS:85199891635
T3 - 2024 9th International Conference on Control and Robotics Engineering, ICCRE 2024
SP - 281
EP - 286
BT - 2024 9th International Conference on Control and Robotics Engineering, ICCRE 2024
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 9th International Conference on Control and Robotics Engineering, ICCRE 2024
Y2 - 10 May 2024 through 12 May 2024
ER -