A Comparison of Two-Stage Approaches Based on Penalized Regression for Estimating Gene Networks

Minhyeok Lee, Junhee Seok, Donghyun Tae, Hua Zhong, Sung Won Han

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Graphical models are commonly used for illustrating gene networks. However, estimating directed networks are generally challenging because of the limited sample size compared with the dimensionality of an experiment. Many previous studies have provided insight into the problem, and recently, two-stage approaches have shown significant improvements for estimating directed acyclic graphs. These two-stage approaches find neighborhoods in the first stage and determine the directions of the edges in the second stage. However, although numerous methods to find neighborhoods and determine directions exist, the most appropriate method to use with two-stage approaches has not been evaluated. Therefore, we compared such methods through extensive simulations to select effective methods for the first and second stages. Results show that adaptive lasso is the most effective for both stages in most cases. In addition, we compared methods to handle asymmetric entries to estimate an undirected network. Some previous studies indicate that the method used to handle asymmetric entries does not affect performance significantly; however, we found that the selection of the handling method for such edges is a significant factor for finding neighborhoods when using adaptive lasso.

Original languageEnglish
Pages (from-to)709-720
Number of pages12
JournalJournal of Computational Biology
Volume24
Issue number7
DOIs
Publication statusPublished - 2017 Jul 1

Fingerprint

Penalized Regression
Gene Networks
Gene Regulatory Networks
Genes
Adaptive Lasso
Experiments
Directed Network
Directed Acyclic Graph
Graphical Models
Sample Size
Dimensionality

Keywords

  • gene network
  • graphical model
  • penalized regression

ASJC Scopus subject areas

  • Modelling and Simulation
  • Molecular Biology
  • Genetics
  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this

A Comparison of Two-Stage Approaches Based on Penalized Regression for Estimating Gene Networks. / Lee, Minhyeok; Seok, Junhee; Tae, Donghyun; Zhong, Hua; Han, Sung Won.

In: Journal of Computational Biology, Vol. 24, No. 7, 01.07.2017, p. 709-720.

Research output: Contribution to journalArticle

@article{516b3aec92a049cca679dddb2b47c163,
title = "A Comparison of Two-Stage Approaches Based on Penalized Regression for Estimating Gene Networks",
abstract = "Graphical models are commonly used for illustrating gene networks. However, estimating directed networks are generally challenging because of the limited sample size compared with the dimensionality of an experiment. Many previous studies have provided insight into the problem, and recently, two-stage approaches have shown significant improvements for estimating directed acyclic graphs. These two-stage approaches find neighborhoods in the first stage and determine the directions of the edges in the second stage. However, although numerous methods to find neighborhoods and determine directions exist, the most appropriate method to use with two-stage approaches has not been evaluated. Therefore, we compared such methods through extensive simulations to select effective methods for the first and second stages. Results show that adaptive lasso is the most effective for both stages in most cases. In addition, we compared methods to handle asymmetric entries to estimate an undirected network. Some previous studies indicate that the method used to handle asymmetric entries does not affect performance significantly; however, we found that the selection of the handling method for such edges is a significant factor for finding neighborhoods when using adaptive lasso.",
keywords = "gene network, graphical model, penalized regression",
author = "Minhyeok Lee and Junhee Seok and Donghyun Tae and Hua Zhong and Han, {Sung Won}",
year = "2017",
month = "7",
day = "1",
doi = "10.1089/cmb.2017.0052",
language = "English",
volume = "24",
pages = "709--720",
journal = "Journal of Computational Biology",
issn = "1066-5277",
publisher = "Mary Ann Liebert Inc.",
number = "7",

}

TY - JOUR

T1 - A Comparison of Two-Stage Approaches Based on Penalized Regression for Estimating Gene Networks

AU - Lee, Minhyeok

AU - Seok, Junhee

AU - Tae, Donghyun

AU - Zhong, Hua

AU - Han, Sung Won

PY - 2017/7/1

Y1 - 2017/7/1

N2 - Graphical models are commonly used for illustrating gene networks. However, estimating directed networks are generally challenging because of the limited sample size compared with the dimensionality of an experiment. Many previous studies have provided insight into the problem, and recently, two-stage approaches have shown significant improvements for estimating directed acyclic graphs. These two-stage approaches find neighborhoods in the first stage and determine the directions of the edges in the second stage. However, although numerous methods to find neighborhoods and determine directions exist, the most appropriate method to use with two-stage approaches has not been evaluated. Therefore, we compared such methods through extensive simulations to select effective methods for the first and second stages. Results show that adaptive lasso is the most effective for both stages in most cases. In addition, we compared methods to handle asymmetric entries to estimate an undirected network. Some previous studies indicate that the method used to handle asymmetric entries does not affect performance significantly; however, we found that the selection of the handling method for such edges is a significant factor for finding neighborhoods when using adaptive lasso.

AB - Graphical models are commonly used for illustrating gene networks. However, estimating directed networks are generally challenging because of the limited sample size compared with the dimensionality of an experiment. Many previous studies have provided insight into the problem, and recently, two-stage approaches have shown significant improvements for estimating directed acyclic graphs. These two-stage approaches find neighborhoods in the first stage and determine the directions of the edges in the second stage. However, although numerous methods to find neighborhoods and determine directions exist, the most appropriate method to use with two-stage approaches has not been evaluated. Therefore, we compared such methods through extensive simulations to select effective methods for the first and second stages. Results show that adaptive lasso is the most effective for both stages in most cases. In addition, we compared methods to handle asymmetric entries to estimate an undirected network. Some previous studies indicate that the method used to handle asymmetric entries does not affect performance significantly; however, we found that the selection of the handling method for such edges is a significant factor for finding neighborhoods when using adaptive lasso.

KW - gene network

KW - graphical model

KW - penalized regression

UR - http://www.scopus.com/inward/record.url?scp=85021745755&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85021745755&partnerID=8YFLogxK

U2 - 10.1089/cmb.2017.0052

DO - 10.1089/cmb.2017.0052

M3 - Article

C2 - 28541712

AN - SCOPUS:85021745755

VL - 24

SP - 709

EP - 720

JO - Journal of Computational Biology

JF - Journal of Computational Biology

SN - 1066-5277

IS - 7

ER -