Skip to main navigation Skip to search Skip to main content

Learning High-dimensional Directed Acyclic Graphs with Mixed Data-types

Research output: Contribution to journal › Conference article › peer-review

Abstract

In recent years, great strides have been made for causal structure learning in the high-dimensional setting and in the mixed data-type setting when there are both discrete and continuous variables. However, due to the complications involved with modeling continuous-discrete variable interactions, the intersection of these two settings has been relatively understudied. The current paper explores the problem of efficiently extending causal structure learning algorithms to high-dimensional data with mixed data-types. First, we characterize a model over continuous and discrete variables. Second, we derive a degenerate Gaussian (DG) score for mixed data-types and discuss its asymptotic properties. Lastly, we demonstrate the practicality of the DG score on learning causal structures from simulated data sets.

Original languageEnglish (US)
Pages (from-to)4-21
Number of pages18
JournalProceedings of Machine Learning Research
Volume104
StatePublished - 2019
Externally publishedYes
Event2019 ACM SIGKDD Workshop on Causal Discovery, CD 2019 - Anchorage, United States
Duration: Aug 5 2019 → …

Bibliographical note

Publisher Copyright:
© 2019 ACM SIGKDD Workshop on Causal Discovery. All Rights Reserved.

Keywords

  • Causal Structure Learning
  • Directed Acyclic Graphs
  • High-dimensional Data
  • Mixed Data-types

Fingerprint

Dive into the research topics of 'Learning High-dimensional Directed Acyclic Graphs with Mixed Data-types'. Together they form a unique fingerprint.

Cite this