Evidence map›Paper›PMID 22889876›Full record

ReviewStatistical applications in genetics and molecular biology2011

Random forests for genetic association studies.

Benjamin A Goldstein, Eric C Polley, Farren B S Briggs

Abstract readReview
In one paragraph

Review in Statistical applications in genetics and molecular biology, 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 98 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
98citing papers in PubMed, 1 pooled it
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

98 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Trial
  3. Review
  4. Article
  5. Article
  6. Article
  7. Development and comparison of machine learning models for predicting postoperative ileus after posterior thoracolumbar fracture surgery.European spine journal : official publication of the European Spine Society, the European Spinal Deformity Society, and the European Section of the Cervical Spine Research Society · 2026
    Article
  8. Article
  9. Article
  10. Review
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article

38 more citing papers are in PubMed but not listed here.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Benjamin A GoldsteinQuantitative Sciences Unit, Department of Medicine, Stanford University, USA.
Eric C Polley
Farren B S Briggs

Funding

GENOMICST32HG000047 · NHGRI · UNIVERSITY OF CALIFORNIA BERKELEY · PI RASMUS NIELSEN, Daniel Soleyman Rokhsar · 2000 to 2026
$13.5M
NHGRI NIH HHS T32 HG000047NHGRI NIH HHS T32 HG 00047
6 · The paper itself

Abstract

The Random Forests (RF) algorithm has become a commonly used machine learning algorithm for genetic association studies. It is well suited for genetic applications since it is both computationally efficient and models genetic causal mechanisms well. With its growing ubiquity, there has been inconsistent and less than optimal use of RF in the literature. The purpose of this review is to breakdown the theoretical and statistical basis of RF so that practitioners are able to apply it in their work. An emphasis is placed on showing how the various components contribute to bias and variance, as well as discussing variable importance measures. Applications specific to genetic studies are highlighted. To provide context, RF is compared to other commonly used machine learning algorithms.

Indexed as

AlgorithmsArtificial IntelligenceData Interpretation, StatisticalGenome-Wide Association StudyHumansPolymorphism, Single Nucleotide

Identifiers

PMID22889876
PMCPMC3154091

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.