2020
DOI: 10.1504/ijdmb.2020.105437
|View full text |Cite
|
Sign up to set email alerts
|

The correlation-based redundancy multiple-filter approach for gene selection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…is met, the number of halted generations, or the best fitness value is obtained. Algorithm 1: The main steps of the GOA algorithm Initialize a set of random solutions xi (i = 1,2,3, … , n) as an initial population Initialize the GOA parameters cMax, cMin, and Max number of iterations Evaluate the fitness of all individuals T = the best solution while (k < maximum number of iterations) do Update c using equation (7) for each solution in the population, do Standardize the distance between grasshopper into [1,4] Update the position vectors using equation (8) Update the step vectors according to equation ( 10) end for there is a better solution, update T k = k+1 end while Output the T Algorithm 1 presents the pseudo-code of the conventional GOA algorithm. It can be observed that the GOA algorithm randomly generates its initial population and assesses each search agent using an objective criterion upon the optimization process begin.…”
Section: Termination Phasementioning
confidence: 99%
See 1 more Smart Citation
“…is met, the number of halted generations, or the best fitness value is obtained. Algorithm 1: The main steps of the GOA algorithm Initialize a set of random solutions xi (i = 1,2,3, … , n) as an initial population Initialize the GOA parameters cMax, cMin, and Max number of iterations Evaluate the fitness of all individuals T = the best solution while (k < maximum number of iterations) do Update c using equation (7) for each solution in the population, do Standardize the distance between grasshopper into [1,4] Update the position vectors using equation (8) Update the step vectors according to equation ( 10) end for there is a better solution, update T k = k+1 end while Output the T Algorithm 1 presents the pseudo-code of the conventional GOA algorithm. It can be observed that the GOA algorithm randomly generates its initial population and assesses each search agent using an objective criterion upon the optimization process begin.…”
Section: Termination Phasementioning
confidence: 99%
“…Over the last decades, rapid technological developments have enabled researchers to analyse a massive amount of data from various application domains such as biomedical, information retrieval, and text classification [1]. The characteristics of these datasets are a massive number of features with limited available samples and imbalanced class distribution; these open challenges have degraded the classification performance of most learning algorithms [2].…”
Section: Introductionmentioning
confidence: 99%