Evidence map›Paper›PMID 32046651›Full record

ArticleBMC bioinformatics2020

GARS: Genetic Algorithm for the identification of a Robust Subset of features in high-dimensional datasets.

Mattia Chiesa, Giada Maioli, Gualtiero I Colombo, Luca Piacentini

Abstract read
In one paragraph

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

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

12 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Prediction of Breast Cancer using Machine Learning Approaches.Journal of biomedical physics & engineering · 2022
    Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Review
  10. Article
  11. Review
  12. 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

4 authors.

Mattia ChiesaUnit of Immunology and Functional Genomics, Centro Cardiologico Monzino IRCCS, Via Carlo Parea, 4, 20138, Milan, Italy. mattia.chiesa@cardiologicomonzino.it.ORCID http://orcid.org/0000-0001-7427-9954
Giada MaioliDepartment of Electrical, Computer and Biomedical Engineering, University of Pavia, Pavia, Italy.
Gualtiero I ColomboUnit of Immunology and Functional Genomics, Centro Cardiologico Monzino IRCCS, Via Carlo Parea, 4, 20138, Milan, Italy.
Luca PiacentiniUnit of Immunology and Functional Genomics, Centro Cardiologico Monzino IRCCS, Via Carlo Parea, 4, 20138, Milan, Italy.

Funding

Ministero della Salute 2631150Ministero della Salute 2631219
6 · The paper itself

Abstract

backgroundFeature selection is a crucial step in machine learning analysis. Currently, many feature selection approaches do not ensure satisfying results, in terms of accuracy and computational time, when the amount of data is huge, such as in 'Omics' datasets.

resultsHere, we propose an innovative implementation of a genetic algorithm, called GARS, for fast and accurate identification of informative features in multi-class and high-dimensional datasets. In all simulations, GARS outperformed two standard filter-based and two 'wrapper' and one embedded' selection methods, showing high classification accuracies in a reasonable computational time.

conclusionsGARS proved to be a suitable tool for performing feature selection on high-dimensional data. Therefore, GARS could be adopted when standard feature selection approaches do not provide satisfactory results or when there is a huge amount of data to be analyzed.

Indexed as

AlgorithmsMachine LearningDatasets as TopicFeature selectionGenetic algorithmsHigh-dimensional dataMachine learningOmics

Identifiers

PMID32046651
PMCPMC7014945

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.