Evidence map›Paper›PMID 37509188›Full record

ArticleBiomolecules2023

Graph Random Forest: A Graph Embedded Algorithm for Identifying Highly Connected Important Features.

Leqi Tian, Wenbin Wu, Tianwei Yu

Abstract read
In one paragraph

Article in Biomolecules, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 21 papers.

0numbers the graph read from it
0cells of the map it votes in
21citing papers in PubMed
–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

21 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Review
  5. Review
  6. Article
  7. Article
  8. Predictive Modeling of Heart Failure Outcomes Using ECG Monitoring Indicators and Machine Learning.Annals of noninvasive electrocardiology : the official journal of the International Society for Holter and Noninvasive Electrocardiology, Inc · 2025
    Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article
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.

Leqi TianSchool of Data Science, The Chinese University of Hong Kong, Shenzhen 518172, China.ORCID 0000-0001-6080-4076
Wenbin WuSchool of Data Science, The Chinese University of Hong Kong, Shenzhen 518172, China.ORCID 0009-0001-7106-7435
Tianwei YuSchool of Data Science, The Chinese University of Hong Kong, Shenzhen 518172, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Random Forest (RF) is a widely used machine learning method with good performance on classification and regression tasks. It works well under low sample size situations, which benefits applications in the field of biology. For example, gene expression data often involve much larger numbers of features (p) compared to the size of samples (n). Though the predictive accuracy using RF is often high, there are some problems when selecting important genes using RF. The important genes selected by RF are usually scattered on the gene network, which conflicts with the biological assumption of functional consistency between effective features. To improve feature selection by incorporating external topological information between genes, we propose the Graph Random Forest (GRF) for identifying highly connected important features by involving the known biological network when constructing the forest. The algorithm can identify effective features that form highly connected sub-graphs and achieve equivalent classification accuracy to RF. To evaluate the capability of our proposed method, we conducted simulation experiments and applied the method to two real datasets-non-small cell lung cancer RNA-seq data from The Cancer Genome Atlas, and human embryonic stem cell RNA-seq dataset (GSE93593). The resulting high classification accuracy, connectivity of selected sub-graphs, and interpretable feature selection results suggest the method is a helpful addition to graph-based classification models and feature selection procedures.

Indexed as

Carcinoma, Non-Small-Cell LungLung NeoplasmsAlgorithmsHumansMachine LearningRandom Forestfeature selectiongene networkrandom forest

Identifiers

PMID37509188
PMCPMC10377046

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.