EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

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

Leqi Tian iD, Wenbin Wu iD, Tianwei Yu

Biomolecules · 20.07.2023 · 13 (7) · 1153

DOI: 10.3390/biom13071153 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Biomolecules, online erschienen am 20.07.2023. Verfasst von Leqi Tian und 2 weiteren Autor:innen. Beteiligte Einrichtung: School of Data Science, The Chinese University of Hong Kong, Shenzhen 518172, China. Hauptthemen laut MEDLINE: Carcinoma, Non-Small-Cell Lung, Lung Neoplasms. Die Arbeit wurde bisher 37-mal zitiert (Crossref) und nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Key R&D Program of China, Guangdong Talent Program.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Carcinoma, Non-Small-Cell LungLung NeoplasmsHumansRandom ForestAlgorithmsMachine Learning

Stichwörter der Autor:innen

feature selectiongene networkrandom forest

Autor:innen und Institutionen

  • School of Data Science, The Chinese University of Hong Kong, Shenzhen 518172, China.
  • Shenzhen Research Institute of Big Data, Shenzhen 518172, China.
  • Guangdong Provincial Key Laboratory of Big Data Computing, Shenzhen 518172, China.

ORCID-Profile: Leqi Tian, Wenbin Wu

Förderung

  • National Key R&D Program of China
  • Guangdong Talent Program

Zitieren

APA

Tian, L., Wu, W., & Yu, T. (2023). Graph Random Forest: A Graph Embedded Algorithm for Identifying Highly Connected Important Features. Biomolecules, 13(7), 1153. https://doi.org/10.3390/biom13071153

Vancouver

Tian L, Wu W, Yu T. Graph Random Forest: A Graph Embedded Algorithm for Identifying Highly Connected Important Features. Biomolecules. 2023;13(7):1153. doi:10.3390/biom13071153

BibTeX
@article{Tian2023,
  author = {Tian, Leqi and Wu, Wenbin and Yu, Tianwei},
  title = {Graph Random Forest: A Graph Embedded Algorithm for Identifying Highly Connected Important Features},
  journal = {Biomolecules},
  year = {2023},
  volume = {13},
  number = {7},
  pages = {1153},
  doi = {10.3390/biom13071153}
}
Kostenlos starten →