Iterative random forests to discover predictive and stable high-order interactions
From MaRDI portal
Abstract: Genomics has revolutionized biology, enabling the interrogation of whole transcriptomes, genome-wide binding sites for proteins, and many other molecular processes. However, individual genomic assays measure elements that interact in vivo as components of larger molecular machines. Understanding how these high-order interactions drive gene expression presents a substantial statistical challenge. Building on Random Forests (RF), Random Intersection Trees (RITs), and through extensive, biologically inspired simulations, we developed the iterative Random Forest algorithm (iRF). iRF trains a feature-weighted ensemble of decision trees to detect stable, high-order interactions with same order of computational cost as RF. We demonstrate the utility of iRF for high-order interaction discovery in two prediction problems: enhancer activity in the early Drosophila embryo and alternative splicing of primary transcripts in human derived cell lines. In Drosophila, among the 20 pairwise transcription factor interactions iRF identifies as stable (returned in more than half of bootstrap replicates), 80% have been previously reported as physical interactions. Moreover, novel third-order interactions, e.g. between Zelda (Zld), Giant (Gt), and Twist (Twi), suggest high-order relationships that are candidates for follow-up experiments. In human-derived cells, iRF re-discovered a central role of H3K36me3 in chromatin-mediated splicing regulation, and identified novel 5th and 6th order interactions, indicative of multi-valent nucleosomes with specific roles in splicing regulation. By decoupling the order of interactions from the computational cost of identification, iRF opens new avenues of inquiry into the molecular mechanisms underlying genome biology.
Recommendations
- Random intersection trees
- Exploring interactions in high-dimensional genomic data: an overview of logic regression, with applications
- A weighted random forests approach to improve predictive performance
- Random forests for genetic association studies
- Genome-Wide Discovery of Modulators of Transcriptional Interactions in Human B Lymphocytes
Cited in
(17)- Learning stable and predictive structures in kinetic systems
- Towards convergence rate analysis of random forests for classification
- Interaction forests: identifying and exploiting interpretable quantitative and qualitative interaction effects
- Local Linear Forests
- The Holdout Randomization Test for Feature Selection in Black Box Models
- The Data Science Process: One Culture
- Veridical data science
- Interpreting uninterpretable predictors: kernel methods, Shtarkov solutions, and random forests
- The Data Science Process: One Culture
- Stable Discovery of Interpretable Subgroups via Calibration in Causal Studies
- What is uncertainty in today's practice of data science?
- Higher-order neurodynamical equation for simplex prediction
- Detecting statistical interactions in immune receptor data: a comparative study
- Pure interaction effects unseen by Random Forests
- How do applied researchers use the causal forest? A methodological review
- Enhancement of persistence in the rock-paper-scissors dynamics through higher-order interactions
- Designing a Data Science Simulation with ℳℰℛℐ𝒯𝒮: A Primer
This page was built for publication: Iterative random forests to discover predictive and stable high-order interactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967427)
