Evidence map›Paper›PMID 35484501›Full record

ArticleBMC bioinformatics2022

Comparison of five supervised feature selection algorithms leading to top features and gene signatures from multi-omics data in cancer.

Tapas Bhadra, Saurav Mallik, Neaj Hasan, Zhongming Zhao

Abstract read
In one paragraph

Article in BMC bioinformatics, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 15 papers.

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

15 citing papers in PubMed.

  1. Article
  2. Article
  3. Review
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Review
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Review
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

4 authors.

Tapas BhadraDepartment of Computer Science and Engineering, Aliah University, Kolkata, West Bengal, 700160, India.
Saurav MallikCenter for Precision Health, School of Biomedical Informatics, The University of Texas Health Science Center at Houston, Houston, TX, 77030, USA.ORCID http://orcid.org/0000-0003-4107-6784
Neaj HasanDepartment of Computer Science and Engineering, Aliah University, Kolkata, West Bengal, 700160, India.
Zhongming ZhaoCenter for Precision Health, School of Biomedical Informatics, The University of Texas Health Science Center at Houston, Houston, TX, 77030, USA. Zhongming.Zhao@uth.tmc.edu.ORCID http://orcid.org/0000-0002-3477-0914

Funding

Transforming dbGaP genetic and genomic data to FAIR-ready by artificial intelligence and machine learning algorithmsR01LM012806 · NLM · UNIVERSITY OF TEXAS HLTH SCI CTR HOUSTON · PI Zhongming Zhao · 2017 to 2026
$3.7M
NLM NIH HHS R01 LM012806
6 · The paper itself

Abstract

backgroundAs many complex omics data have been generated during the last two decades, dimensionality reduction problem has been a challenging issue in better mining such data. The omics data typically consists of many features. Accordingly, many feature selection algorithms have been developed. The performance of those feature selection methods often varies by specific data, making the discovery and interpretation of results challenging. METHODS AND

resultsIn this study, we performed a comprehensive comparative study of five widely used supervised feature selection methods (mRMR, INMIFS, DFS, SVM-RFE-CBR and VWMRmR) for multi-omics datasets. Specifically, we used five representative datasets: gene expression (Exp), exon expression (ExpExon), DNA methylation (hMethyl27), copy number variation (Gistic2), and pathway activity dataset (Paradigm IPLs) from a multi-omics study of acute myeloid leukemia (LAML) from The Cancer Genome Atlas (TCGA). The different feature subsets selected by the aforesaid five different feature selection algorithms are assessed using three evaluation criteria: (1) classification accuracy (Acc), (2) representation entropy (RE) and (3) redundancy rate (RR). Four different classifiers, viz., C4.5, NaiveBayes, KNN, and AdaBoost, were used to measure the classification accuary (Acc) for each selected feature subset. The VWMRmR algorithm obtains the best Acc for three datasets (ExpExon, hMethyl27 and Paradigm IPLs). The VWMRmR algorithm offers the best RR (obtained using normalized mutual information) for three datasets (Exp, Gistic2 and Paradigm IPLs), while it gives the best RR (obtained using Pearson correlation coefficient) for two datasets (Gistic2 and Paradigm IPLs). It also obtains the best RE for three datasets (Exp, Gistic2 and Paradigm IPLs). Overall, the VWMRmR algorithm yields best performance for all three evaluation criteria for majority of the datasets. In addition, we identified signature genes using supervised learning collected from the overlapped top feature set among five feature selection methods. We obtained a 7-gene signature (ZMIZ1, ENG, FGFR1, PAWR, KRT17, MPO and LAT2) for EXP, a 9-gene signature for ExpExon, a 7-gene signature for hMethyl27, one single-gene signature (PIK3CG) for Gistic2 and a 3-gene signature for Paradigm IPLs.

conclusionWe performed a comprehensive comparison of the performance evaluation of five well-known feature selection methods for mining features from various high-dimensional datasets. We identified signature genes using supervised learning for the specific omic data for the disease. The study will help incorporate higher order dependencies among features.

Indexed as

DNA Copy Number VariationsNeoplasmsAlgorithmsDNA MethylationHumansClassifierFeature selectionMulti-omics dataRedundancy rateRepresentation entropy

Identifiers

PMID35484501
PMCPMC9052461

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.