scholarly journals The Use of Evolution in a Central Action Selection Model

2007 ◽  
Vol 4 (3) ◽  
pp. 91-100
Author(s):  
F. Montes-Gonzalez ◽  
P. Bautista-Cabrera ◽  
V. Escobar-Ruiz
Keyword(s):  
Genetic Algorithm ◽  
Foraging Behaviour ◽  
Sensory Information ◽  
Selection Model ◽  
Central Action ◽  
Selection Mechanism ◽  
Behavioural Pattern ◽  
Intensive Use ◽  
Foraging Task ◽  
Colour Segmentation

The use of effective central selection provides flexibility in design by offering modularity and extensibility. In earlier papers we have focused on the development of a simple centralized selection mechanism. Our current goal is to integrate evolutionary methods in the design of non-sequential behaviours and the tuning of specific parameters of the selection model. The foraging behaviour of an animal robot (animat) has been modelled in order to integrate the sensory information from the robot to perform selection that is nearly optimized by the use of genetic algorithms. In this paper we present how selection through optimization finally arranges the pattern of presented behaviours for the foraging task. Hence, the execution of specific parts in a behavioural pattern may be ruled out by the tuning of these parameters. Furthermore, the intensive use of colour segmentation from a colour camera for locating a cylinder sets a burden on the calculations carried out by the genetic algorithm.

Optimization of Preloaded Coefficient Based on the Adapted CBR

2009 ◽  
Vol 628-629 ◽  
pp. 13-18
Author(s):  
H.L. Li ◽  
Li Hui Lang ◽  
W. Jiao ◽  
H.Z. Su
Keyword(s):  
Genetic Algorithm ◽  
Optimum Design ◽  
Prediction Error ◽  
Selection Model ◽  
Knowledge Based Systems ◽  
Estimation Model ◽  
Knowledge Based ◽  
Adjustment Model ◽  
Successful Technique

Selecting an appropriate preloaded coefficient has always been a challenge in wire- winding prestressed structure optimum design. Cased-based reasoning (CBR) has become a successful technique for knowledge-based systems in many domains. However, hardly any research has addressed the issue of how to generate the adaptation solution when the case has been retrieved. The present paper investigates the adoption of genetic algorithm(GA) to explore the suitable adjustment model. Two adapted model were presented and assessed in terms of their mean relative prediction error rates.The experiment results shown that applying GA to adjust the preloaded coefficient selection model is a feasible approach to largely improve the accuracy of estimation model. It also demonstrate that the adapted CBR presents better estimate accuracy than the results ontained by other unadapted CBR methods.

scholarly journals A Feature Selection Model for Network Intrusion Detection System Based on PSO, GWO, FFA and GA Algorithms

Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 1046 ◽  
Author(s):  
Omar Almomani
Keyword(s):  
Genetic Algorithm ◽  
Feature Selection ◽  
Intrusion Detection ◽  
Intrusion Detection System ◽  
Detection System ◽  
Selection Model ◽  
Network Intrusion Detection ◽  
Network Intrusion ◽  
Proposed Model ◽  
Positive Rate

The network intrusion detection system (NIDS) aims to identify virulent action in a network. It aims to do that through investigating the traffic network behavior. The approaches of data mining and machine learning (ML) are extensively used in the NIDS to discover anomalies. Regarding feature selection, it plays a significant role in improving the performance of NIDSs. That is because anomaly detection employs a great number of features that require much time. Therefore, the feature selection approach affects the time needed to investigate the traffic behavior and improve the accuracy level. The researcher of the present study aimed to propose a feature selection model for NIDSs. This model is based on the particle swarm optimization (PSO), grey wolf optimizer (GWO), firefly optimization (FFA) and genetic algorithm (GA). The proposed model aims at improving the performance of NIDSs. The proposed model deploys wrapper-based methods with the GA, PSO, GWO and FFA algorithms for selecting features using Anaconda Python Open Source, and deploys filtering-based methods for the mutual information (MI) of the GA, PSO, GWO and FFA algorithms that produced 13 sets of rules. The features derived from the proposed model are evaluated based on the support vector machine (SVM) and J48 ML classifiers and the UNSW-NB15 dataset. Based on the experiment, Rule 13 (R13) reduces the features into 30 features. Rule 12 (R12) reduces the features into 13 features. Rule 13 and Rule 12 offer the best results in terms of F-measure, accuracy and sensitivity. The genetic algorithm (GA) shows good results in terms of True Positive Rate (TPR) and False Negative Rate (FNR). As for Rules 11, 9 and 8, they show good results in terms of False Positive Rate (FPR), while PSO shows good results in terms of precision and True Negative Rate (TNR). It was found that the intrusion detection system with fewer features will increase accuracy. The proposed feature selection model for NIDS is rule-based pattern recognition to discover computer network attack which is in the scope of Symmetry journal.

scholarly journals The quasispecies regime for the simple genetic algorithm with roulette wheel selection

2017 ◽  
Vol 49 (3) ◽  
pp. 903-926 ◽  
Author(s):  
Raphaël Cerf
Keyword(s):  
Genetic Algorithm ◽  
Selection Mechanism ◽  
Roulette Wheel Selection ◽  
Mutation Probability ◽  
Roulette Wheel ◽  
Simple Genetic Algorithm ◽  
Crossover Probability ◽  
Mean Fitness ◽  
The Mean ◽  
Best Fit

Abstract We introduce a new parameter to discuss the behavior of a genetic algorithm. This parameter is the mean number of exact copies of the best-fit chromosomes from one generation to the next. We believe that the genetic algorithm operates best when this parameter is slightly larger than 1 and we prove two results supporting this belief. We consider the case of the simple genetic algorithm with the roulette wheel selection mechanism. We denote by ℓ the length of the chromosomes, m the population size, pC the crossover probability, and pM the mutation probability. Our results suggest that the mutation and crossover probabilities should be tuned so that, at each generation, the maximal fitness multiplied by (1 - pC)(1 - pM)ℓ is greater than the mean fitness.

scholarly journals The use of evolution in a central action selection model

2007 ◽  
Vol 4 (3) ◽  
pp. 91-100
Author(s):  
F. Montes-Gonzalez ◽  
P. Bautista-Cabrera ◽  
V. Escobar-Ruiz
Keyword(s):  
Action Selection ◽  
Selection Model ◽  
Central Action
Sign in / Sign up

Export Citation Format

Share Document