scholarly journals Application of Multilayer Perceptron Genetic Algorithm Neural Network in Chinese-English Parallel Corpus Noise Processing

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Bing Li ◽  
Anxie Tuo ◽  
Hanyue Kong ◽  
Sujiao Liu ◽  
Jia Chen
Keyword(s):  
Neural Network ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Recognition Rate ◽  
Solution Space ◽  
Search Space ◽  
Comparison Method ◽  
Parallel Corpus ◽  
Search Mechanism ◽  
Multiple Regions

This paper uses neural network as a predictive model and genetic algorithm as an online optimization algorithm to simulate the noise processing of Chinese-English parallel corpus. At the same time, according to the powerful random global search mechanism of genetic algorithm, this paper studied the principle and process of noise processing in Chinese-English parallel corpus. Aiming at the task of identifying isolated words for unspecified persons, taking into account the inadequacies of the algorithms in standard genetic algorithms and neural networks, this paper proposes a fast algorithm for training the network using genetic algorithms. Through simulation calculations, different characteristic parameters, the number of training samples, background noise, and whether a specific person affects the recognition result were analyzed and discussed and compared with the traditional dynamic time comparison method. This paper introduces the idea of reinforcement learning, uses different reward mechanisms to solve the inconsistency of loss function and evaluation index measurement methods, and uses different decoding methods to alleviate the problem of exposure bias. It uses various simple genetic operations and the survival of the fittest selection mechanism to guide the learning process and determine the direction of the search, and it can search multiple regions in the solution space at the same time. In addition, it also has the advantage of not being restricted by the restrictive conditions of the search space (such as differentiable, continuous, and unimodal). At the same time, a method of using English subword vectors to initialize the parameters of the translation model is given. The research results show that the neural network recognition method based on genetic algorithm which is given in this paper shows its ability of quickly learning network weights and it is superior to the standard in all aspects. The performance of the algorithm in genetic algorithm and neural network, with high recognition rate and unique application advantages, can achieve a win-win of time and efficiency.

Minimization of total trim loss occurring in pipe cutting in shipbuilding with genetic algorithm

2021 ◽  
pp. 147509022199169
Author(s):  
Abdullah Türk ◽  
Dursun Saral ◽  
Murat Özkök ◽  
Ercan Köse
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Search Space ◽  
Cutting Process ◽  
Genetic Operators ◽  
Critical Stage ◽  
Different Types ◽  
Trim Loss ◽  
Pipe Systems

Outfitting is a critical stage in the shipbuilding process. Within the outfitting, the construction of pipe systems is a phase that has a significant effect on time and cost. While cutting the pipes required for the pipe systems in shipyards, the cutting process is usually performed randomly. This can result in large amounts of trim losses. In this paper, we present an approach to minimize these losses. With the proposed method it is aimed to base the pipe cutting process on a specific systematic. To solve this problem, Genetic Algorithms (GA), which gives successful results in solving many problems in the literature, have been used. Different types of genetic operators have been used to investigate the search space of the problem well. The results obtained have proven the effectiveness of the proposed approach.

scholarly journals PENENTUAN PARAMETER LEARNING RATE SELAMA PEMBELAJARAN JARINGAN SYARAF TIRUAN BACKPROPAGATION MENGGUNAKAN ALGORITMA GENETIKA

2020 ◽  
Vol 14 (2) ◽  
pp. 202-212
Author(s):  
Ade chandra Saputra
Keyword(s):  
Neural Network ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Fitness Function ◽  
Learning Rate ◽  
Local Minima ◽  
Rate Parameter ◽  
Neural Network Learning ◽  
Value Of Learning ◽  
Backpropagation Learning

One of the weakness in backpropagation Artificial neural network(ANN) is being stuck in local minima. Learning rate parameter is an important parameter in order to determine how fast the ANN Learning. This research is conducted to determine a method of finding the value of learning rate parameter using a genetic algorithm when neural network learning stops and the error value is not reached the stopping criteria or has not reached the convergence. Genetic algorithm is used to determine the value of learning rate used is based on the calculation of the fitness function with the input of the ANN weights, gradient error, and bias. The calculation of the fitness function will produce an error value of each learning rate which represents each candidate solutions or individual genetic algorithms. Each individual is determined by sum of squared error value. One with the smallest SSE is the best individual. The value of learning rate has chosen will be used to continue learning so that it can lower the value of the error or speed up the learning towards convergence. The final result of this study is to provide a new solution to resolve the problem in the backpropagation learning that often have problems in determining the learning parameters. These results indicate that the method of genetic algorithms can provide a solution for backpropagation learning in order to decrease the value of SSE when learning of ANN has been static in large error conditions, or stuck in local minima

Actuator hysteresis modeling and compensation with an adaptive search space based genetic algorithm

2021 ◽  
Author(s):  
Che-Hang Cliff Chan
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Search Space ◽  
Parameters Identification ◽  
Experimental Results ◽  
Adaptive Search ◽  
Real Coded Genetic Algorithm ◽  
Hysteresis Modeling ◽  
Convergence Performance ◽  
Solution Accuracy

The thesis presents a Genetic Algorithm with Adaptive Search Space (GAASS) proposed to improve both convergence performance and solution accuracy of traditional Genetic Algorithms(GAs). The propsed GAASS method has bee hybridized to a real-coded genetic algorithm to perform hysteresis parameters identification and hystereis invers compensation of an electromechanical-valve acuator installed on a pneumatic system. The experimental results have demonstrated the supreme performance of the proposed GAASS in the search of optimum solutions.

Genetic Algorithms for Decision-Making in Cognitive Radio Networks

2013 ◽  
pp. 247-263
Author(s):  
Tommy Hult ◽  
Abbas Mohammed
Keyword(s):  
Genetic Algorithm ◽  
Decision Making ◽  
Genetic Algorithms ◽  
Cognitive Radio ◽  
Search Space ◽  
Radio Spectrum ◽  
Dynamic Decision Making ◽  
Optimal Point ◽  
Optimization Search

Efficient use of the available licensed radio spectrum is becoming increasingly difficult as the demand and usage of the radio spectrum increases. This usage of the spectrum is not uniform within the licensed band but concentrated in certain frequencies of the spectrum while other parts of the spectrum are inefficiently utilized. In cognitive radio environments, the primary users are allocated licensed frequency bands while secondary cognitive users dynamically allocate the empty frequencies within the licensed frequency band according to their requested QoS (Quality of Service) specifications. This dynamic decision-making is a multi-criteria optimization problem, which the authors propose to solve using a genetic algorithm. Genetic algorithms traverse the optimization search space using a multitude of parallel solutions and choosing the solution that has the best overall fit to the criteria. Due to this parallelism, the genetic algorithm is less likely than traditional algorithms to get caught at a local optimal point.

scholarly journals The Use of Neural Networks and Genetic Algorithms for Design of Groundwater Remediation Schemes

1997 ◽  
Vol 1 (2) ◽  
pp. 345-356 ◽  
Author(s):  
Z. Rao ◽  
D. G. Jamieson
Keyword(s):  
Neural Network ◽  
Genetic Algorithm ◽  
Neural Networks ◽  
Artificial Neural Network ◽  
Genetic Algorithms ◽  
Hybrid Algorithm ◽  
Large Scale ◽  
Groundwater Remediation ◽  
Injection Wells ◽  
Representative Problem

Abstract. The increasing incidence of groundwater pollution has led to recognition of a need to develop objective techniques for designing reniediation schemes. This paper outlines one such possibility for determining how many abstraction/injection wells are required, where they should be located etc., having regard to minimising the overall cost. To that end, an artificial neural network is used in association with a 2-D or 3-D groundwater simulation model to determine the performance of different combinations of abstraction/injection wells. Thereafter, a genetic algorithm is used to identify which of these combinations offers the least-cost solution to achieve the prescribed residual levels of pollutant within whatever timescale is specified. The resultant hybrid algorithm has been shown to be effective for a simplified but nevertheless representative problem; based on the results presented, it is expected the methodology developed will be equally applicable to large-scale, real-world situations.

Analysis of Pavement Management Activities Programming by Genetic Algorithms

1998 ◽  
Vol 1643 (1) ◽  
pp. 1-6 ◽  
Author(s):  
T. F. Fwa ◽  
W. T. Chan ◽  
K. Z. Hoque
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Solution Space ◽  
Pavement Management ◽  
Practical Significance ◽  
Optimization Analysis ◽  
Large Solution ◽  
Pavement Management System ◽  
Pavement Maintenance ◽  
Operational Characteristics

The application of genetic algorithms to programming of pavement maintenance activities at the network level is demonstrated. The operational characteristics of the genetic algorithm technique and its relevance to solving the programming problem in a Pavement Management System (PMS) are discussed. The robust search capability of genetic algorithms enables them to effectively handle the highly constrained problem of pavement management activities programming, which has an extremely large solution space of astronomical scale. Examples are presented to highlight the versatility of genetic algorithms in accommodating different objective function forms. This versatility makes the algorithms an effective tool for planning in PMS. It is also demonstrated that composite objective functions that combine two or more different objectives can be easily considered without having to reformulate the genetic algorithm computer program. Another useful feature of genetic algorithm solutions is the availability of near-optimal solutions besides the "best" solution. This has practical significance as it gives the users the flexibility to examine the suitability of each solution when practical constraints and factors not included in the optimization analysis are considered.

scholarly journals Real-Coded Quantum-Inspired Genetic Algorithm-Based BP Neural Network Algorithm

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Jianyong Liu ◽  
Huaixiao Wang ◽  
Yangyang Sun ◽  
Chengqun Fu ◽  
Jie Guo
Keyword(s):  
Neural Network ◽  
Genetic Algorithm ◽  
Bp Neural Network ◽  
Search Space ◽  
Descent Method ◽  
Gradient Descent Method ◽  
Quantum Genetic Algorithm ◽  
Binary Coding ◽  
Optimal Value ◽  
Neural Network Algorithm

The method that the real-coded quantum-inspired genetic algorithm (RQGA) used to optimize the weights and threshold of BP neural network is proposed to overcome the defect that the gradient descent method makes the algorithm easily fall into local optimal value in the learning process. Quantum genetic algorithm (QGA) is with good directional global optimization ability, but the conventional QGA is based on binary coding; the speed of calculation is reduced by the coding and decoding processes. So, RQGA is introduced to explore the search space, and the improved varied learning rate is adopted to train the BP neural network. Simulation test shows that the proposed algorithm is effective to rapidly converge to the solution conformed to constraint conditions.

scholarly journals NEAT Snake: a both evolutionary and neural network adaptation approach

2020 ◽  
Author(s):  
Alisson Steffens Henrique ◽  
Vinicius Almeida dos Santos ◽  
Rodrigo Lyra
Keyword(s):  
Neural Network ◽  
Genetic Algorithm ◽  
Neural Networks ◽  
Decision Making ◽  
Genetic Algorithms ◽  
Real Time ◽  
Relative Position ◽  
Network Adaptation ◽  
The Neural Network

There are several challenges when modeling artificial intelligencemethods for autonomous players on games (bots). NEAT is one ofthe models that, combining genetic algorithms and neural networks,seek to describe a bot behavior more intelligently. In NEAT, a neuralnetwork is used for decision making, taking relevant inputs fromthe environment and giving real-time decisions. In a more abstractway, a genetic algorithm is applied for the learning step of the neuralnetworks’ weights, layers, and parameters. This paper proposes theuse of relative position as the input of the neural network, basedon the hypothesis that the bot profit will be improved.

scholarly journals FACE RECOGNITION IN EIGEN DOMAIN WITH NEURO-FUZZY CLASSIFIER AND EVOLUTIONARY OPTIMIZATION

2012 ◽  
pp. 129-133
Author(s):  
PRASANTH.R. S ◽  
SARITHA. R
Keyword(s):  
Neural Network ◽  
Genetic Algorithm ◽  
Feature Extraction ◽  
Face Recognition ◽  
Optimization Technique ◽  
Recognition Rate ◽  
Fuzzy Classifier ◽  
Neuro Fuzzy ◽  
Extraction Test ◽  
Almost All

Face Recognition is a nascent field of research with many challenges. The proposed system focuses on recognizing faces in a faster and more accurate way using eigenface approach and genetic algorithm by considering the entire problem as an optimization problem. It consists of two stages: Eigenface approach is used for feature extraction and genetic algorithm based feed forward Neuro-Fuzzy System is used for face recognition. Classification of face images to a particular class is done using an artificial neural network. The training of neural network is done using genetic algorithm, a machine learning approach which optimizes the weights used in the neural network. This is an efficient optimization technique and an evolutionary classification method. The algorithm has been tested on 200 images (20 classes). A recognition score for test lot is calculated by considering almost all the variants of feature extraction. Test results gave a recognition rate of 97.01%.

LZW Encoding in Genetic Algorithm

2011 ◽  
Vol 2 (4) ◽  
pp. 25-36 ◽  
Author(s):  
Worasait Suwannik
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Original Problem ◽  
Search Space ◽  
Binary String ◽  
Exponential Rate

To solve a problem using Genetic Algorithms (GAs), a solution must be encoded into a binary string. The length of the binary string represents the size of the problem. As the length of the binary string increases, the size of the search space also increases at an exponential rate. To reduce the search space, one approach is to use a compressed encoding chromosome. This paper presents a genetic algorithm, called LZWGA, that uses compressed chromosomes. An LZWGA chromosome must be decompressed using an LZW decompression algorithm before its fitness can be evaluated. By using compressed encoding, the search space is reduced dramatically. For one-million-bit problem, the search space of the original problem is 21000000 or about 9.90x10301029 points. When using a compressed encoding, the search space was reduced to 8.37x10166717 points. LZWGA can solve one-million-bit OneMax, RoyalRoad, and Trap functions.

Sign in / Sign up

Export Citation Format

Share Document