Discovering Dynamic Causal Space for DAG Structure Learning-Reference-Cited by-同舟云学术

Discovering Dynamic Causal Space for DAG Structure Learning

Published:2023-08-04 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Liu Fangfu¹^ORCID,Ma Wenchang²^ORCID,Zhang An²^ORCID,Wang Xiang³^ORCID,Duan Yueqi¹^ORCID,Chua Tat-Seng²^ORCID

Affiliation:

1. Tsinghua University, Beijing, China

2. National University of Singapore, Singapore, Singapore

3. University of Science and Technology of China, Hefei, China

Funder

National Natural Science Foundation of China

University Synergy Innovation Program of Anhui Province

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3580305.3599309

Reference60 articles.

1. Albert-László Barabási and Réka Albert . 1999. Emergence of scaling in random networks. science , Vol. 286 , 5439 ( 1999 ), 509--512. Albert-László Barabási and Réka Albert. 1999. Emergence of scaling in random networks. science, Vol. 286, 5439 (1999), 509--512.

2. Nonlinear Programming

3. Rohit Bhattacharya , Tushar Nagarajan , Daniel Malinsky , and Ilya Shpitser . 2021 . Differentiable causal discovery under unmeasured confounding . In International Conference on Artificial Intelligence and Statistics. PMLR, 2314--2322 . Rohit Bhattacharya, Tushar Nagarajan, Daniel Malinsky, and Ilya Shpitser. 2021. Differentiable causal discovery under unmeasured confounding. In International Conference on Artificial Intelligence and Statistics. PMLR, 2314--2322.

4. David Maxwell Chickering . 1996. Learning Bayesian networks is NP-complete . In Learning from data . Springer , 121--130. David Maxwell Chickering. 1996. Learning Bayesian networks is NP-complete. In Learning from data. Springer, 121--130.