Iterative random forests to discover predictive and stable high-order interactions
From MaRDI portal
Publication:4967427
DOI10.1073/pnas.1711236115zbMath1416.62594arXiv1706.08457OpenAlexW2731142262WikidataQ47558704 ScholiaQ47558704MaRDI QIDQ4967427
No author found.
Publication date: 3 July 2019
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.08457
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10)
Related Items (11)
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 ⋮ 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 ⋮ The Data Science Process: One Culture ⋮ Learning stable and predictive structures in kinetic systems: Benefits of a causal approach ⋮ Veridical data science ⋮ Towards convergence rate analysis of random forests for classification ⋮ The Data Science Process: One Culture
This page was built for publication: Iterative random forests to discover predictive and stable high-order interactions
