2019
DOI: 10.1109/access.2019.2942962
|View full text |Cite
|
Sign up to set email alerts
|

Self-Tune Linear Adaptive-Genetic Algorithm for Feature Selection

Abstract: Genetic algorithm (GA) is an established machine learning technique used for heuristic optimisation purposes. However, this natural selection-based technique is prone to premature convergence, especially of the local optimum event. The presence of stagnant performance is due to low population diversity and fixed genetic operator setting. Therefore, an adaptive algorithm, the Self-Tune Linear Adaptive-GA (STLA-GA), is presented in order to avoid suboptimal solutions in feature selection case studies. STLA-GA pe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 32 publications
0
6
0
Order By: Relevance
“…Hence, the GA parameters should be optimized to find the ideal simulation parameters using tuning algorithms (Eiben and Smit, 2012; Montero et al , 2018). For example, Ooi et al (2019) proposed a self-tune linear adaptive GA which modifies the mutation probability rate and the population size based on the diversity of the population. Moreover, the product specifications should undergo a sensitivity analysis to evaluate the robustness of the design.…”
Section: Resultsmentioning
confidence: 99%
“…Hence, the GA parameters should be optimized to find the ideal simulation parameters using tuning algorithms (Eiben and Smit, 2012; Montero et al , 2018). For example, Ooi et al (2019) proposed a self-tune linear adaptive GA which modifies the mutation probability rate and the population size based on the diversity of the population. Moreover, the product specifications should undergo a sensitivity analysis to evaluate the robustness of the design.…”
Section: Resultsmentioning
confidence: 99%
“…Recombination ‐ also known as crossover ‐ is the process of creating offspring, or children, by combining two different solutions, or parents. Our study utilised crossover scattered [29], a specific implementation of crossover. This method works by creating a random binary vector R , where ‘1’ indicates selecting bits from the first parent and ‘0’ indicates selecting bits from the second parent.…”
Section: Methods and Definitionsmentioning
confidence: 99%
“…Leong et al, Ooi et al, and Lim et al proposed an adaptive Genetic Algorithm to overcome problems faced in standard feature selection processes such as convergence towards local optima, manual parameter tuning, premature convergence, lower feature subset reduction rates, and the excessive cost of computation. The proposed STLA-GA was able to outperform classic feature-selection methods due to its adaptive nature [ 16 ].…”
Section: Introductionmentioning
confidence: 99%