BiXGBoost: a scalable, flexible boosting-based method for reconstructing gene regulatory networks.
Journal
Bioinformatics (Oxford, England)
ISSN: 1367-4811
Titre abrégé: Bioinformatics
Pays: England
ID NLM: 9808944
Informations de publication
Date de publication:
01 06 2019
01 06 2019
Historique:
received:
27
10
2018
revised:
28
10
2018
accepted:
04
11
2018
pubmed:
6
11
2018
medline:
10
6
2020
entrez:
6
11
2018
Statut:
ppublish
Résumé
Reconstructing gene regulatory networks (GRNs) based on gene expression profiles is still an enormous challenge in systems biology. Random forest-based methods have been proved a kind of efficient methods to evaluate the importance of gene regulations. Nevertheless, the accuracy of traditional methods can be further improved. With time-series gene expression data, exploiting inherent time information and high order time lag are promising strategies to improve the power and accuracy of GRNs inference. In this study, we propose a scalable, flexible approach called BiXGBoost to reconstruct GRNs. BiXGBoost is a bidirectional-based method by considering both candidate regulatory genes and target genes for a specific gene. Moreover, BiXGBoost utilizes time information efficiently and integrates XGBoost to evaluate the feature importance. Randomization and regularization are also applied in BiXGBoost to address the over-fitting problem. The results on DREAM4 and Escherichia coli datasets show the good performance of BiXGBoost on different scale of networks. Our Python implementation of BiXGBoost is available at https://github.com/zrq0123/BiXGBoost. Supplementary data are available at Bioinformatics online.
Identifiants
pubmed: 30395189
pii: 5161079
doi: 10.1093/bioinformatics/bty908
doi:
Types de publication
Journal Article
Research Support, Non-U.S. Gov't
Langues
eng
Sous-ensembles de citation
IM
Pagination
1893-1900Informations de copyright
© The Author(s) 2018. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.