Online Program Home
My Program

Abstract Details

Activity Number: 433
Type: Contributed
Date/Time: Tuesday, August 2, 2016 : 2:00 PM to 3:50 PM
Sponsor: Section on Statistical Learning and Data Science
Abstract #320161 View Presentation
Title: Reconstruction of Directed Acyclic Graphs Networks Based on Prior Causal Ordering Information with Applications to Gene Regulatory Networks
Author(s): Pei-Li Wang* and George Michailidis
Companies: University of Florida and University of Florida
Keywords: Estimation of Directed Acyclic Graphs ; High-dimensional data ; sparsity

Directed Acyclic Graphs (DAG) capture causal relations between random variables in various fields. However, their reconstruction (estimation) from observational data is a challenging task due to the computational hardness of the learning task. We study this estimation problem when prior information exists on partial orderings of sets of nodes. Specifically, it is assumed that the nodes are partitioned in different sets for which ordering information exists. We develop a framework for a high-dimensional sparse regime, that combines penalized regression to delineate relationships amongst nodes in different sets, with the popular PC-algorithm that identifies the skeleton of the graph within each set. In the final step, we combine the results from the regression and PC-algorithm steps and develop an adjustment step to eliminate redundant edges. The framework is evaluated on simulated data sets from the DREAM3 competition.

Authors who are presenting talks have a * after their name.

Back to the full JSM 2016 program

Copyright © American Statistical Association