Preprint Article Version 1 This version is not peer-reviewed

A High Performance Computing Implementation of Iterative Random Forest for the Creation of Predictive Expression Networks

Version 1 : Received: 29 October 2019 / Approved: 31 October 2019 / Online: 31 October 2019 (02:33:17 CET)

How to cite: Cliff, A.; Romero, J.; Kainer, D.; Jacobson, D. A High Performance Computing Implementation of Iterative Random Forest for the Creation of Predictive Expression Networks. Preprints 2019, 2019100360 (doi: 10.20944/preprints201910.0360.v1). Cliff, A.; Romero, J.; Kainer, D.; Jacobson, D. A High Performance Computing Implementation of Iterative Random Forest for the Creation of Predictive Expression Networks. Preprints 2019, 2019100360 (doi: 10.20944/preprints201910.0360.v1).

Abstract

As time progresses and technology improves, biological data sets are continuously increasing in size. New methods and new implementations of existing methods are needed to keep pace with this increase. In this paper, we present a high performance computing(HPC)-capable implementation of Iterative Random Forest (iRF). This new implementation enables the explainable-AI eQTL analysis of SNP sets with over a million SNPs. Using this implementation we also present a new method, iRF Leave One Out Prediction (iRF-LOOP), for the creation of Predictive Expression Networks on the order of 40,000 genes or more. We compare the new implementation of iRF with the previous R version and analyze its time to completion on two of the world's fastest supercomputers Summit and Titan. We also show iRF-LOOP's ability to capture biologically significant results when creating Predictive Expression Networks. This new implementation of iRF will enable the analysis of biological data sets at scales that were previously not possible.

Subject Areas

Random Forest; Iterative Random Forest; gene expression networks; high performance computing; X-AI-based eQTL

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.