Genetic Learning

2009 ◽  
pp. 120-130
Author(s):  
Ivan Bruha
Keyword(s):  
Machine Learning ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Variable Length ◽  
Numerical Attributes ◽  
Meta Level

This chapter discusses the incorporation of genetic algorithms into machine learning. It does not present the principles of genetic algorithms (because it has been already done by many more or less large monographs) but rather focuses particularly on some important issues and enhancements of genetic algorithms design is faced by, namely: (a) the ways of initialization of a population for a genetic algorithm, (b) representation of chromosomes (individuals) in genetic algorithms (because it plays an influential role in the entire processing), and (c) discretization and fuzzification of numerical attributes for genetic algorithms (since they are not in its genuine form able to process these attributes). Furthermore, this chapter surveys new trends of dealing with the variable-length chromosomes and other issues related to the genetic learners. It concludes by discussing some directions of further improvement of the genetic learners, namely two topologies with the ‘meta’ level.

Machine Learning Accelerated Genetic Algorithms for Computational Materials Search

2018 ◽  
Author(s):  
Steen Lysgaard ◽  
Paul C. Jennings ◽  
Jens Strabo Hummelshøj ◽  
Thomas Bligaard ◽  
Tejs Vegge
Keyword(s):  
Machine Learning ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Au Nanoparticles ◽  
Learning Model ◽  
Energy Calculations ◽  
Atomic Distribution ◽  
Machine Learning Model ◽  
Fold Reduction ◽  
Computational Materials

A machine learning model is used as a surrogate fitness evaluator in a genetic algorithm (GA) optimization of the atomic distribution of Pt-Au nanoparticles. The machine learning accelerated genetic algorithm (MLaGA) yields a 50-fold reduction of required energy calculations compared to a traditional GA.

scholarly journals Machine Learning Accelerated Genetic Algorithms for Computational Materials Search

2018 ◽  
Author(s):  
Steen Lysgaard ◽  
Paul C. Jennings ◽  
Jens Strabo Hummelshøj ◽  
Thomas Bligaard ◽  
Tejs Vegge
Keyword(s):  
Machine Learning ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Au Nanoparticles ◽  
Learning Model ◽  
Energy Calculations ◽  
Atomic Distribution ◽  
Machine Learning Model ◽  
Fold Reduction ◽  
Computational Materials

A machine learning model is used as a surrogate fitness evaluator in a genetic algorithm (GA) optimization of the atomic distribution of Pt-Au nanoparticles. The machine learning accelerated genetic algorithm (MLaGA) yields a 50-fold reduction of required energy calculations compared to a traditional GA.

scholarly journals Hybrid Modeling KMeans – Genetic Algorithms in the Health Care Data

2013 ◽  
Vol 2 (1) ◽  
Author(s):  
Tessy Badriyah
Keyword(s):  
Machine Learning ◽  
Genetic Algorithm ◽  
Health Care ◽  
Genetic Algorithms ◽  
Hybrid Method ◽  
Health Care Data ◽  
Computational Performance ◽  
Genetic Algorithm Approach ◽  
A New Technique ◽  
Published Research

K-Means is one of the major algorithms widely used in clustering due to its good computational performance. However, K-Means is very sensitive to the initially selected points which randomly selected, and therefore it does not always generate optimum solutions. Genetic algorithm approach can be applied to solve this problem. In this research we examine the potential of applying hybrid GA- KMeans with focus on the area of health care data. We proposed a new technique using hybrid method combining KMeans Clustering and Genetic Algorithms, called the “Hybrid K-Means Genetic Algorithms” (HKGA). HKGA combines the power of Genetic Algorithms and the efficiency of K-Means Clustering. We compare our results with other conventional algorithms and also with other published research as well. Our results demonstrate that the HKGA achieves very good results and in some cases superior to other methods.Keywords: Machine Learning, K-Means, Genetic Algorithms, Hybrid KMeans Genetic Algorithm (HGKA).

Evolutionary Computation and Genetic Algorithms

2011 ◽  
pp. 817-822
Author(s):  
William H. Hsu
Keyword(s):  
Machine Learning ◽  
Genetic Algorithm ◽  
Computer Simulation ◽  
Genetic Algorithms ◽  
Natural Selection ◽  
Evolutionary Biology ◽  
Approximate Solutions ◽  
Learning Problems ◽  
Abstract Representations ◽  
Search Optimization

A genetic algorithm (GA) is a method used to find approximate solutions to difficult search, optimization, and machine learning problems (Goldberg, 1989) by applying principles of evolutionary biology to computer science. Genetic algorithms use biologically-derived techniques such as inheritance, mutation, natural selection, and recombination. They are a particular class of evolutionary algorithms. Genetic algorithms are typically implemented as a computer simulation in which a population of abstract representations (called chromosomes) of candidate solutions (called individuals) to an optimization problem evolves toward better solutions. Traditionally, solutions are represented in binary as strings of 0s and 1s, but different encodings are also possible. The evolution starts from a population of completely random individuals and happens in generations. In each generation, multiple individuals are stochastically selected from the current population, modified (mutated or recombined) to form a new population, which becomes current in the next iteration of the algorithm.

scholarly journals Android Malware Detection Using Machine Learning with Feature Selection Based on the Genetic Algorithm

Mathematics ◽  
2021 ◽  
Vol 9 (21) ◽  
pp. 2813
Author(s):  
Jaehyeong Lee ◽  
Hyuk Jang ◽  
Sungmin Ha ◽  
Yourim Yoon
Keyword(s):  
Machine Learning ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Feature Selection ◽  
Malware Detection ◽  
Feature Selection Method ◽  
Machine Learning Algorithms ◽  
Android Malware ◽  
Detection Techniques ◽  
Android Malware Detection

Since the discovery that machine learning can be used to effectively detect Android malware, many studies on machine learning-based malware detection techniques have been conducted. Several methods based on feature selection, particularly genetic algorithms, have been proposed to increase the performance and reduce costs. However, because they have yet to be compared with other methods and their many features have not been sufficiently verified, such methods have certain limitations. This study investigates whether genetic algorithm-based feature selection helps Android malware detection. We applied nine machine learning algorithms with genetic algorithm-based feature selection for 1104 static features through 5000 benign applications and 2500 malwares included in the Andro-AutoPsy dataset. Comparative experimental results show that the genetic algorithm performed better than the information gain-based method, which is generally used as a feature selection method. Moreover, machine learning using the proposed genetic algorithm-based feature selection has an absolute advantage in terms of time compared to machine learning without feature selection. The results indicate that incorporating genetic algorithms into Android malware detection is a valuable approach. Furthermore, to improve malware detection performance, it is useful to apply genetic algorithm-based feature selection to machine learning.

scholarly journals A Variable-Length Chromosome Genetic Algorithm for Time-Based Sensor Network Schedule Optimization

Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 3990
Author(s):  
Van-Phuong Ha ◽  
Trung-Kien Dao ◽  
Ngoc-Yen Pham ◽  
Minh-Hoang Le
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Sensor Network ◽  
Optimal Solution ◽  
Stochastic Approach ◽  
Variable Length ◽  
Sensor Nodes ◽  
Fixed Length ◽  
Network Schedule ◽  
Application Requirements

Scheduling sensor nodes has an important role in real monitoring applications using sensor networks, lowering the power consumption and maximizing the network lifetime, while maintaining the satisfaction to application requirements. Nevertheless, this problem is usually very complex and not easily resolved by analytical methods. In a different manner, genetic algorithms (GAs) are heuristic search strategies that help to find the exact or approximate global optimal solution efficiently with a stochastic approach. Genetic algorithms are advantageous for their robustness to discrete and noisy objective functions, as they are only evaluated at independent points without requirements of continuity or differentiability. However, as explained in this paper, a time-based sensor network schedule cannot be represented by a chromosome with fixed length that is required in traditional genetic algorithms. Therefore, an extended genetic algorithm is introduced with variable-length chromosome (VLC) along with mutation and crossover operations in order to address this problem. Simulation results show that, with help of carefully defined fitness functions, the proposed scheme is able to evolve the individuals in the population effectively and consistently from generation to generation towards optimal ones, and the obtained network schedules are better optimized in comparison with the result of algorithms employing a fixed-length chromosome.

Machine Learning Accelerated Genetic Algorithms for Computational Materials Search

2018 ◽  
Author(s):  
Steen Lysgaard ◽  
Paul C. Jennings ◽  
Jens Strabo Hummelshøj ◽  
Thomas Bligaard ◽  
Tejs Vegge
Keyword(s):  
Machine Learning ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Au Nanoparticles ◽  
Learning Model ◽  
Energy Calculations ◽  
Atomic Distribution ◽  
Machine Learning Model ◽  
Fold Reduction ◽  
Computational Materials

A machine learning model is used as a surrogate fitness evaluator in a genetic algorithm (GA) optimization of the atomic distribution of Pt-Au nanoparticles. The machine learning accelerated genetic algorithm (MLaGA) yields a 50-fold reduction of required energy calculations compared to a traditional GA.

scholarly journals The Use of Neural Networks and Genetic Algorithms to Control Low Rigidity Shafts Machining

Sensors ◽  
2020 ◽  
Vol 20 (17) ◽  
pp. 4683
Author(s):  
Antoni Świć ◽  
Dariusz Wołos ◽  
Arkadiusz Gola ◽  
Grzegorz Kłosowski
Keyword(s):  
Neural Network ◽  
Machine Learning ◽  
Genetic Algorithm ◽  
Neural Networks ◽  
Genetic Algorithms ◽  
Short Term Memory ◽  
Real Life ◽  
Control Process ◽  
Lstm Network ◽  
High Level

The article presents an original machine-learning-based automated approach for controlling the process of machining of low-rigidity shafts using artificial intelligence methods. Three models of hybrid controllers based on different types of neural networks and genetic algorithms were developed. In this study, an objective function optimized by a genetic algorithm was replaced with a neural network trained on real-life data. The task of the genetic algorithm is to select the optimal values of the input parameters of a neural network to ensure minimum deviation. Both input vector values and the neural network’s output values are real numbers, which means the problem under consideration is regressive. The performance of three types of neural networks was analyzed: a classic multilayer perceptron network, a nonlinear autoregressive network with exogenous input (NARX) prediction network, and a deep recurrent long short-term memory (LSTM) network. Algorithmic machine learning methods were used to achieve a high level of automation of the control process. By training the network on data from real measurements, we were able to control the reliability of the turning process, taking into account many factors that are usually overlooked during mathematical modelling. Positive results of the experiments confirm the effectiveness of the proposed method for controlling low-rigidity shaft turning.

Formulation of Colors Using a Genetic Algorithm

2012 ◽  
Vol 17 (4) ◽  
pp. 241-244
Author(s):  
Cezary Draus ◽  
Grzegorz Nowak ◽  
Maciej Nowak ◽  
Marcin Tokarski
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Production Process ◽  
Computer Technology ◽  
Manual Method ◽  
Apply Genetic ◽  
Computer Aided ◽  
Multiple Samples ◽  
Plastics Industry

Abstract The possibility to obtain a desired color of the product and to ensure its repeatability in the production process is highly desired in many industries such as printing, automobile, dyeing, textile, cosmetics or plastics industry. So far, most companies have traditionally used the "manual" method, relying on intuition and experience of a colorist. However, the manual preparation of multiple samples and their correction can be very time consuming and expensive. The computer technology has allowed the development of software to support the process of matching colors. Nowadays, formulation of colors is done with appropriate equipment (colorimeters, spectrophotometers, computers) and dedicated software. Computer-aided formulation is much faster and cheaper than manual formulation, because fewer corrective iterations have to be carried out, to achieve the desired result. Moreover, the colors are analyzed with regard to the metamerism, and the best recipe can be chosen, according to the specific criteria (price, quantity, availability). Optimaization problem of color formulation can be solved in many diferent ways. Authors decided to apply genetic algorithms in this domain.

scholarly journals Application of Genetic Algorithm Elements to Modelling of Rotation Processes in Motion Transmission Including a Long Shaft

Energies ◽  
2020 ◽  
Vol 14 (1) ◽  
pp. 115
Author(s):  
Andriy Chaban ◽  
Marek Lis ◽  
Andrzej Szafraniec ◽  
Radoslaw Jedynak
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Fitness Function ◽  
Least Square ◽  
Distributed Parameter ◽  
Parameter Method ◽  
Analytical Mechanics ◽  
Parameter System ◽  
Rotational Systems ◽  
Elastic Elements

Genetic algorithms are used to parameter identification of the model of oscillatory processes in complicated motion transmission of electric drives containing long elastic shafts as systems of distributed mechanical parameters. Shaft equations are generated on the basis of a modified Hamilton–Ostrogradski principle, which serves as the foundation to analyse the lumped parameter system and distributed parameter system. They serve to compute basic functions of analytical mechanics of velocity continuum and rotational angles of shaft elements. It is demonstrated that the application of the distributed parameter method to multi-mass rotational systems, that contain long elastic elements and complicated control systems, is not always possible. The genetic algorithm is applied to determine the coefficients of approximation the system of Rotational Transmission with Elastic Shaft by equivalent differential equations. The fitness function is determined as least-square error. The obtained results confirm that application of the genetic algorithms allow one to replace the use of a complicated distributed parameter model of mechanical system by a considerably simpler model, and to eliminate sophisticated calculation procedures and identification of boundary conditions for wave motion equations of long elastic elements.

Sign in / Sign up

Export Citation Format

Share Document