z-logo
Premium
Joint skeleton estimation of multiple directed acyclic graphs for heterogeneous population
Author(s) -
Liu Jianyu,
Sun Wei,
Liu Yufeng
Publication year - 2019
Publication title -
biometrics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.298
H-Index - 130
eISSN - 1541-0420
pISSN - 0006-341X
DOI - 10.1111/biom.12941
Subject(s) - skeleton (computer programming) , directed acyclic graph , joint (building) , estimation , population , directed graph , computer science , mathematics , mathematical optimization , algorithm , medicine , engineering , environmental health , programming language , architectural engineering , systems engineering
Summary The directed acyclic graph (DAG) is a powerful tool to model the interactions of high‐dimensional variables. While estimating edge directions in a DAG often requires interventional data, one can estimate the skeleton of a DAG (i.e., an undirected graph formed by removing the direction of each edge in a DAG) using observational data. In real data analyses, the samples of the high‐dimensional variables may be collected from a mixture of multiple populations. Each population has its own DAG while the DAGs across populations may have significant overlap. In this article, we propose a two‐step approach to jointly estimate the DAG skeletons of multiple populations while the population origin of each sample may or may not be labeled. In particular, our method allows a probabilistic soft label for each sample, which can be easily computed and often leads to more accurate skeleton estimation than hard labels. Compared with separate estimation of skeletons for each population, our method is more accurate and robust to labeling errors. We study the estimation consistency for our method, and demonstrate its performance using simulation studies in different settings. Finally, we apply our method to analyze gene expression data from breast cancer patients of multiple cancer subtypes.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here