بدائل البحث:
driven optimization » level optimization (توسيع البحث), spider optimization (توسيع البحث)
i based » ni based (توسيع البحث), _ based (توسيع البحث), 3 based (توسيع البحث)
driven optimization » level optimization (توسيع البحث), spider optimization (توسيع البحث)
i based » ni based (توسيع البحث), _ based (توسيع البحث), 3 based (توسيع البحث)
-
1
An enhanced binary Rat Swarm Optimizer based on local-best concepts of PSO and collaborative crossover operators for feature selection
منشور في 2022"…In this paper, a recent swarm intelligence metaheuristic method called RSO which is inspired by the social and hunting behavior of a group of rats is enhanced and explored for FS problems. The binary enhanced RSO is built based on three successive modifications: i) an S-shape transfer function is used to develop binary RSO algorithms; ii) the local search paradigm of particle swarm optimization is used with the iterative loop of RSO to boost its local exploitation; iii) three crossover mechanisms are used and controlled by a switch probability to improve the diversity. …"
-
2
-
3
Multiclass feature selection with metaheuristic optimization algorithms: a review
منشور في 2022"…Metaheuristic algorithms have also been presented in four primary behavior-based categories, i.e., evolutionary-based, swarm-intelligence-based, physics-based, and human-based, even though some literature works presented more categorization. …"
احصل على النص الكامل
-
4
A new genetic algorithm approach for unit commitment
منشور في 1997احصل على النص الكامل
احصل على النص الكامل
article -
5
Learning-Based Automatic Modulation Classification
منشور في 2015احصل على النص الكامل
doctoralThesis -
6
-
7
A hybrid model to predict the pressure gradient for the liquid-liquid flow in both horizontal and inclined pipes for unknown flow patterns
منشور في 2023"…The important feature subset is identified using the modified Binary Grey Wolf Optimization Particle Swarm Optimization (BGWOPSO) algorithm. …"
-
8
A method for data path synthesis using neural networks
منشور في 2017"…The proposed algorithm has a running time complexity of O(1) for a neural network with n vertices and c cliques. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject