Evidence map›Paper›PMID 31222027›Full record

ArticleScientific reports2019

A Hybrid Gene Selection Method Based on ReliefF and Ant Colony Optimization Algorithm for Tumor Classification.

Lin Sun, Xianglin Kong, Jiucheng Xu, Zhan'ao Xue, Ruibing Zhai, Shiguang Zhang

Open access · goldAbstract read
In one paragraph

Article in Scientific reports, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.

0numbers the graph read from it
0cells of the map it votes in
11citing papers in PubMed
4.1field-weighted citation impact, top 5% of its field
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

11 citing papers in PubMed, 88 citations in OpenAlex.

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

6 authors at 2 institutions in 1 country.

Lin SunCollege of Computer and Information Engineering, Henan Normal University, Xinxiang, 453007, China. linsunok@gmail.com.ORCID http://orcid.org/0000-0003-4917-7651
Xianglin KongCollege of Computer and Information Engineering, Henan Normal University, Xinxiang, 453007, China.
Jiucheng XuCollege of Computer and Information Engineering, Henan Normal University, Xinxiang, 453007, China. jiuchxu@gmail.com.ORCID http://orcid.org/0000-0003-1518-3623
Zhan'ao XueCollege of Computer and Information Engineering, Henan Normal University, Xinxiang, 453007, China.
Ruibing ZhaiCollege of Computer and Information Engineering, Henan Normal University, Xinxiang, 453007, China.
Shiguang ZhangCollege of Computer and Information Engineering, Henan Normal University, Xinxiang, 453007, China.
Henan Normal University · CNTianjin University of Science and Technology · CN

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

For the DNA microarray datasets, tumor classification based on gene expression profiles has drawn great attention, and gene selection plays a significant role in improving the classification performance of microarray data. In this study, an effective hybrid gene selection method based on ReliefF and Ant colony optimization (ACO) algorithm for tumor classification is proposed. First, for the ReliefF algorithm, the average distance among k nearest or k non-nearest neighbor samples are introduced to estimate the difference among samples, based on which the distances between the samples in the same class or the different classes are defined, and then it can more effectively evaluate the weight values of genes for samples. To obtain the stable results in emergencies, a distance coefficient is developed to construct a new formula of updating weight coefficient of genes to further reduce the instability during calculations. When decreasing the distance between the same samples and increasing the distance between the different samples, the weight division is more obvious. Thus, the ReliefF algorithm can be improved to reduce the initial dimensionality of gene expression datasets and obtain a candidate gene subset. Second, a new pruning rule is designed to reduce dimensionality and obtain a new candidate subset with the smaller number of genes. The probability formula of the next point in the path selected by the ants is presented to highlight the closeness of the correlation relationship between the reaction variables. To increase the pheromone concentration of important genes, a new phenotype updating formula of the ACO algorithm is adopted to prevent the pheromone left by the ants that are overwhelmed with time, and then the weight coefficients of the genes are applied here to eliminate the interference of difference data as much as possible. It follows that the improved ACO algorithm has the ability of the strong positive feedback, which quickly converges to an optimal solution through the accumulation and the updating of pheromone. Finally, by combining the improved ReliefF algorithm and the improved ACO method, a hybrid filter-wrapper-based gene selection algorithm called as RFACO-GS is proposed. The experimental results under several public gene expression datasets demonstrate that the proposed method is very effective, which can significantly reduce the dimensionality of gene expression datasets, and select the most relevant genes with high classification accuracy.

Indexed as

AlgorithmsBiomarkers, TumorComputational BiologyHumansNeoplasmsOligonucleotide Array Sequence AnalysisOncogene Proteins, FusionReproducibility of ResultsBiomarkers, TumorOncogene Proteins, Fusion

Identifiers

PMID31222027
PMCPMC6586811
OpenAlexW2952122819

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.