Scalable causal graph learning through a deep neural network

26Citations
Citations of this article
61Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Learning the causal graph in a complex system is crucial for knowledge discovery and decision making, yet it remains a challenging problem because of the unknown nonlinear interaction among system components. Most of the existing methods either rely on predefined kernel or data distribution, or they focus simply on the causality between a single target and the remaining system. This work presents a deep neural network for scalable causal graph learning (SCGL) through low-rank approximation. The SCGL model can explore nonlinearity on both temporal and intervariable relationships without any predefined kernel or distribution assumptions. Through low-rank approximation, the noise influence is reduced, and better accuracy and high scalability are achieved. Experiments using synthetic and real-world datasets show that our SCGL algorithm outperforms existing state-of-the-art methods for causal graph learning.

Cite

CITATION STYLE

APA

Xu, C., Huang, H., & Yoo, S. (2019). Scalable causal graph learning through a deep neural network. In International Conference on Information and Knowledge Management, Proceedings (pp. 1853–1862). Association for Computing Machinery. https://doi.org/10.1145/3357384.3357864

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free