Cargando…
Provable Boolean interaction recovery from tree ensemble obtained via random forests
Random Forests (RFs) are at the cutting edge of supervised machine learning in terms of prediction performance, especially in genomics. Iterative RFs (iRFs) use a tree ensemble from iteratively modified RFs to obtain predictive and stable nonlinear or Boolean interactions of features. They have show...
Autores principales: | Behr, Merle, Wang, Yu, Li, Xiao, Yu, Bin |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
National Academy of Sciences
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9295780/ https://www.ncbi.nlm.nih.gov/pubmed/35609192 http://dx.doi.org/10.1073/pnas.2118636119 |
Ejemplares similares
-
Elliptic PDE learning is provably data-efficient
por: Boullé, Nicolas, et al.
Publicado: (2023) -
Provable randomized rounding for minimum-similarity diversification
por: Ordozgoiti, Bruno, et al.
Publicado: (2022) -
Provability, complexity, grammars
por: Beklemishev, Lev, et al.
Publicado: (1999) -
Provably correct systems
por: Hinchey, Mike, et al.
Publicado: (2017) -
Symbiotic Interaction Enhances the Recovery of Endangered Tree Species in the Fragmented Maulino Forest
por: Torres-Díaz, Cristian, et al.
Publicado: (2021)