A Note on Crossover with Interval Representations
|
|
- Bertina O’Neal’
- 5 years ago
- Views:
Transcription
1 A Note on Crossover with Interval Representations Christopher Stone and Larry Bull UWE Learning Classifier System Technical Report UWELCSG03-00 Faculty of Computing, Engineering and Mathematical Sciences University of the West of England Bristol, BS16 1QY, United Kingdom Abstract. We analyse crossover in Learning Classifier Systems with three different interval representations, using both niche and panmictic Genetic Algorithms. We find that the choice of interval representation has a significant bearing on the characteristics of offspring interval produced and the means by which evolutionary search is carried out. 1 Introduction Learning Classifier Systems [] typically use a ternary representation to encode the environmental condition that a classifier matches. Bits in the condition string of a classifier are allocated to represent the state of a single environmental variable, x i. Exact matching in this way is generally not suitable for a continuousvalued environment X R n, where real-valued data over a range must be represented. The representations considered here replace the {0,1,#} classifier predicate with one representing a half-open interval [p i,q i ) [4, 6, 7]. This interval matches the environment if p i x i < q i. The classifier condition is a vector of length n, each element of which encodes such an interval. A classifier with such a representation describes a hyper-rectangle in solution space. This paper studies the effects of crossover in Learning Classifier Systems that use such an interval representation. The interval representations analysed are Centre-Spread Representation (CSR) [6], Ordered Bound Representation (OBR) [3, 7] and Unordered Bound Representation (UBR) [4]. We do this by analysing the effects of crossover on a single interval predicate. In this situation, crossover occurs within an interval predicate, between alleles representing the interval. We refer to this as crossover within interval predicates. Crossover between interval predicates is also possible, where crossover points can occur only between interval predicates. As this type of crossover constructs offspring by exchanging entire intervals and cannot affect the composition of individual intervals, we do not consider it further in the present work. To avoid confusion and aid precision, we adopt the following notation:
2 Christopher Stone and Larry Bull Table 1. Phenotype regions and their structural forms p i Region [p min, q i) p Region 4 [p min, q max) p Region 1 [p i, q i) p Region 3 [p i, q max) p q i Table. Phenotype proportions for crossover within interval predicates with k = 8 Region Form [p i, q i) p [p min, q i) p [p i, q max) p [p min, q max) p Parent proportion CSR niche CSR panmictic OBR niche OBR panmictic UBR niche UBR panmictic Intervals in phenotype space are tagged with the subscript p, e.g., [0,1) p. Intervals in genotype space are tagged with the subscript g, e.g., [0,n] g 3. Tuples are distinguished from intervals by the absence of a subscript. Analysis Previous work [4] studied the effects of crossover with respect to the type of interval (classified by region) generated by the crossover operator. Regions are partitions of the phenotype space corresponding to the four different structural forms of interval predicate shown in Table 1 where p min < p i q max p min q i < q max The effects of crossover were studied for XCS [5] with a niche Genetic Algorithm (GA) [1] only. Other researchers use an interval representation with a panmictic GA [3]. Table extends the results presented in [4] to show the effects of crossover with Centre-Spread Representation, Ordered Bound Representation and Unordered Bound Representation using both niche and panmictic GAs. For consistency with earlier work, we use a binary encoding of length k = 8 bits for real numbers. From the table, it is clear that the distribution of intervals amongst regions depends on the representation in use, but is not materially affected by whether a niche GA or a panmictic GA is used. Analysing the intervals resulting from crossover by region is useful, but it does not tell the whole story of the effects of crossover. It is possible for region 1, and 3 intervals to be generated by crossover with varying widths and to understand the effects of crossover further, we must study the widths of offspring intervals.
3 A Note on Crossover with Interval Representations 3 Using CSR, an interval is represented as a centre and spread tuple (c i,s i ) where c i encodes the centre (or position) of the interval and s i encodes its spread (or width). During crossover within predicates, centre and spread alleles are exchanged: [c 1 i,s 1 i] g [c i,s i] g [c 1 i,s i] g,[c i,s 1 i ] g This process can be viewed one of two ways either that the interval positions are invariant from parent to offspring with the interval widths changing, or that the interval widths are invariant from parent to offspring with the position of the intervals changing. In practice, both of these transformations occur simultaneously. From the perspective of interval width, crossover has the effect of specializing or generalizing intervals by altering their widths (but not positions), whereas from the perspective of interval position, crossover alters the position, but maintains the widths of intervals. The epistasis between centre and spread alleles means that the degree of difference in position and width between parents and offspring depends on the amount of variance between the centres and spreads of the respective parents. Where there is a large difference between parental centres and/or spreads, offspring will have little in common with their parents, so large jumps in interval position or width are possible under crossover. A metric that can be readily observed experimentally is mean interval width. This may be measured for the entire population, for the match set or, as we use it here, for the two parental intervals undergoing crossover and for the resulting two offspring. For CSR, all pairs of offspring produced with CSR preserve the mean interval width of the parents. With OBR, an interval is represented by the tuple (l i,u i ) where l i is the lower bound and u i is the upper bound of the interval. Crossover within predicates swaps the two alleles representing an interval: (l 1 i,u 1 i) (l i,u i) (l 1 i,u i) (l i,u 1 i ) The mean width of the parental intervals is (u 1 i l1 i ) + (u i l i ) The mean width of the offspring intervals for OBR is (u i l1 i ) + (u1 i l i ) = (u1 i l1 i ) + (u i l i ) So, the mean width of the two offspring generated by OBR crossover within predicates is the same as that of the two parental intervals. For UBR, the situation is more complex. Because, in general, there are two possible genotypes, [l i,u i ] g and [u i,l i ] g for a particular phenotype, intervals produced by crossover with UBR depend on the ordering of the parental genotypes.
4 4 Christopher Stone and Larry Bull Table 3. Parental and offspring genotypes for UBR. All four parental genotypes express to the same pair of phenotypes. Offspring genotypes express to two distinct phenotype pairs, A and B Parent 1 Parent Offspring 1 Offspring 1 [li 1, u 1 i] g [li, u i] g [li 1, u i] g [li, u 1 i] g A [li 1, u 1 i] g [u i,li ] g [li 1, li ] g [u i,u 1 i] g B 3 [u 1 i,li 1 ] g [li, u i] g [u 1 i,u i] g [li, li 1 ] g B 4 [u 1 i,li 1 ] g [u i,li ] g [u 1 i,li ] g [u i,li 1 ] g A Table 3 shows the possible parental genotype orderings for a crossing of parental phenotypes [l 1 i,u1 i ) p [l i,u i ) p and the resulting offspring genotypes. The lack of an ordering restriction on genotypes with UBR means that offspring genotypes 1 and 4 in Table 3 are equivalent, as are offspring genotypes and 3, so there are exactly two forms of offspring phenotype, one where parental lower and upper bounds are paired and the other where a parental lower (upper) bound is paired with another parental lower (upper) bound. Note that crossover with OBR can only produce genotypes of type A. The only ordering restriction imposed at the phenotype level is l 1 i u 1 i l i u i We cannot assume anything about the relative values of the bounds of one interval compared to the interval with which it is paired. To proceed, we must consider the possible basic configurations of pairs of intervals. Fig. 1 shows the three possible configurations of parental interval and the offspring configurations that result after crossover if the relative orderings of parental interval bounds are taken into account. Other symmetries of the basic configurations are possible. Parental configurations 1 and occur with both niche and panmictic GAs, as the parental intervals share at least one point in common, namely the environmental variable x i. Configuration 3 can only occur with a panmictic GA as the parental intervals do not overlap. Offspring configurations in column A represent offspring intervals with phenotypes of the form [l 1 i,u i ) p or [l i,u1 i ) p, as in Table 3. As already explained, these can occur with both OBR and UBR. The additional offspring configurations resulting from the use of unordered tuples with UBR appear in offspring column B. These configurations cannot occur with OBR as they have the form [l 1 i,l i ) p or [u 1 i,u i ) p. Fig. shows the possible transitions from the three parental configurations to offspring configurations, where offspring are also classified according to their configuration, 1-3. This shows that only OBR with a niche GA and UBR with a panmictic GA are symmetrical and allow all possible transitions between parental and offspring configurations. It is straightforward to compute the gain or loss of mean interval width from parents to offspring for each of the configurations that appear in Fig. 1. These are shown in Table 4, which, for completeness, also shows this information for
5 A Note on Crossover with Interval Representations 5 Parent Intervals A. OBR & UBR Offspring B. UBR Offspring 1. Niche & Panmictic. Niche & Panmictic 3. Panmictic Fig. 1. Crossover configurations. Parental configurations are rows in the diagram and offspring configurations are columns. Each entry shows two intervals (shaded) in a single dimension of the solution space. The dotted line represents the environmental variable x i OBR Niche UBR Niche OBR Panmictic UBR Panmictic Fig.. Transitions possible from parental to offspring configurations. Numbered states correspond to the configurations shown in Fig. 1 CSR. This makes it apparent that certain configurations of parental and offspring intervals produce a gain or loss of mean interval width during crossover. We can see that crossover with OBR and a niche GA is neutral with respect to mean interval width, but with a panmictic GA it possible to produce offspring intervals that are on average, wider than the parents. Crossover with UBR and a niche GA can produce intervals that are narrower, on average, than the parents, whilst with a panmictic GA it is also possible to produce intervals that are wider, on average, than the parents. These results can also be seen intuitively in Fig. 1 and Fig.. Table 4. Gain or loss of mean interval width from parent to offspring. A gain in mean interval width is shown as positive and a loss as negative Parent CSR A. OBR & UBR B. UBR 1. Niche & panmictic 0 0 (u 1 i li ). Niche & panmictic 0 0 (u i li ) 3. Panmictic 0 +(li u 1 i) +(li u 1 i)
6 6 Christopher Stone and Larry Bull Table 5. Mean interval width for parent and offspring over all possible crossings Representation and GA type Mean parental width Mean offspring width CSR niche CSR panmictic OBR niche OBR panmictic UBR niche UBR panmictic To investigate these effects further, we enumerated all possible combinations of interval for two parents. For niche GA results, we enumerated only those parental intervals that have at least one point in common with each other. For consistency with the results presented in Table and [4], we used an encoding of length k = 8. For each combination, we noted the mean interval width of the parents and offspring and averaged these over all combinations of parental interval to provide an indication of the overall effects of crossover with different representations and types of GA. Results are shown in Table 5. Table 5 shows that over all possible intervals crossover with CSR is neutral with respect to mean interval width for both niche and panmictic GAs. We can also see from these results that the mean interval width for CSR is quite wide (around 0.7), in contrast to OBR and UBR which have a mean interval width of around 0.33 for a niche GA and 0.4 for a panmictic GA. As expected from Fig. and Table 4, crossover with OBR and a niche GA causes no change to the mean interval width of parents and offspring, while crossover with OBR and a panmictic GA tends to generate wider intervals. Conversely, crossover with UBR and a niche GA tends to generate narrower intervals, whereas with UBR and a panmictic GA, no change occurs to mean interval width. Because UBR with a panmictic GA can generate offspring that are both wider and narrower, on average, than those of the parents, it is more difficult to predict the overall direction of the effect. Although this is neutral over all possible crossings, this may not be true for intervals drawn from arbitrary populations. 3 Conclusions There are differences in the characteristics of intervals produced by crossover with the three representations considered for real numbers in Learning Classifier Systems. CSR preserves interval position or width from parents to offspring, which, in general, causes the endpoints of parental intervals to be lost under crossover. OBR and UBR preserve the endpoints of parental intervals, but shuffle them into new combinations to produce offspring intervals. UBR offers additional possibilities for endpoint shuffling over OBR, due to the lack of ordering of bounds in this representation.
7 A Note on Crossover with Interval Representations 7 The GA in a Learning Classifier System with an interval representation is searching for useful hyper-rectangular decision surfaces. Crossover with OBR and UBR appear to facilitate this search by preserving elements of the boundaries of hyper-rectangles represented by high fitness classifiers. In contrast, crossover with CSR constructs offspring by generalizing, specializing or shifting the position of high fitness hyper-rectangles. However, there would seem to be a degree of randomness involved in this process, due to epistatic interactions between centre and spread alleles that do not exist between alleles in OBR and UBR representations. Thus, the search mechanisms of CSR and OBR/UBR work in different ways, both of which are able to produce solutions to problems in continuousvalued environments [4, 6, 7]. References 1. Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, MI. Republished by MIT Press, Holland, J. H. (1986). Escaping brittleness: the possibilities of general-purpose learning algorithms applied to parallel rule-based systems. In R. S. Michalski, J. G. Carbonell & T. M. Mitchell (eds.), Machine Learning, an Artificial Intelligence Approach. Volume II. Los Altos, California: Morgan Kauffmann, pages Hurst, J., Bull, L. & Melhuish, C. (00). TCS Learning Classifier System controller on a real robot. In J. Merelo, P. Adamidis, H-G. Beyer, J-L. Fernandez-Villacanas & H-P. Schwefel (eds.), Parallel Problem Solving from Nature - PPSN VII, Berlin: Springer, pages Stone, C. & Bull, L. (003) For real! XCS with continuous-valued inputs. To appear in Evolutionary Computation. 5. Wilson, S. W. (1995). Classifier fitness based on accuracy. Evolutionary Computation, 3(): Wilson, S. W. (000). Get real! XCS with continuous-valued inputs. In P. L. Lanzi, W. Stolzmann and S. W. Wilson (eds.), Learning Classifier Systems. From Foundations to Applications, Lecture Notes in Artificial Intelligence (LNAI-1813), Berlin: Springer, pages Wilson, S. W. (001). Mining oblique data with XCS. In P. L. Lanzi, W. Stolzmann and S. W. Wilson (eds.), Advances in Learning Classifier Systems. Proceedings of the Third International Workshop (IWLCS-000), Lecture Notes in Artificial Intelligence (LNAI-1996), Berlin: Springer, pages
INVARIANT SUBSETS OF THE SEARCH SPACE AND THE UNIVERSALITY OF A GENERALIZED GENETIC ALGORITHM
INVARIANT SUBSETS OF THE SEARCH SPACE AND THE UNIVERSALITY OF A GENERALIZED GENETIC ALGORITHM BORIS MITAVSKIY Abstract In this paper we shall give a mathematical description of a general evolutionary heuristic
The Evolution of Gene Dominance through the. Baldwin Effect
The Evolution of Gene Dominance through the Baldwin Effect Larry Bull Computer Science Research Centre Department of Computer Science & Creative Technologies University of the West of England, Bristol
Evolutionary Design I
Evolutionary Design I Jason Noble jasonn@comp.leeds.ac.uk Biosystems group, School of Computing Evolutionary Design I p.1/29 This lecture Harnessing evolution in a computer program How to construct a genetic
The Evolution of Sex Chromosomes through the. Baldwin Effect
The Evolution of Sex Chromosomes through the Baldwin Effect Larry Bull Computer Science Research Centre Department of Computer Science & Creative Technologies University of the West of England, Bristol
Bounding the Population Size in XCS to Ensure Reproductive Opportunities
Bounding the Population Size in XCS to Ensure Reproductive Opportunities Martin V. Butz and David E. Goldberg Illinois Genetic Algorithms Laboratory (IlliGAL) University of Illinois at Urbana-Champaign
A Simple Haploid-Diploid Evolutionary Algorithm
A Simple Haploid-Diploid Evolutionary Algorithm Larry Bull Computer Science Research Centre University of the West of England, Bristol, UK larry.bull@uwe.ac.uk Abstract It has recently been suggested that
Hyper-ellipsoidal Conditions In XCS: Rotation, Linear Approximation, and Solution Structure
Hyper-ellipsoidal Conditions In XCS: Rotation, Linear Approximation, and Solution Structure Martin V. Butz Department of Cognitive Psychology University of Würzburg 977 Würzburg, Germany mbutz@psychologie.uniwuerzburg.de
Haploid-Diploid Algorithms
Haploid-Diploid Algorithms Larry Bull Department of Computer Science & Creative Technologies University of the West of England Bristol BS16 1QY, U.K. +44 (0)117 3283161 Larry.Bull@uwe.ac.uk LETTER Abstract
A Statistical Genetic Algorithm
A Statistical Genetic Algorithm Angel Kuri M. akm@pollux.cic.ipn.mx Centro de Investigación en Computación Instituto Politécnico Nacional Zacatenco México 07738, D.F. Abstract A Genetic Algorithm which
Evolutionary Computation. DEIS-Cesena Alma Mater Studiorum Università di Bologna Cesena (Italia)
Evolutionary Computation DEIS-Cesena Alma Mater Studiorum Università di Bologna Cesena (Italia) andrea.roli@unibo.it Evolutionary Computation Inspiring principle: theory of natural selection Species face
Crossover Techniques in GAs
Crossover Techniques in GAs Debasis Samanta Indian Institute of Technology Kharagpur dsamanta@iitkgp.ac.in 16.03.2018 Debasis Samanta (IIT Kharagpur) Soft Computing Applications 16.03.2018 1 / 1 Important
Lecture 22. Introduction to Genetic Algorithms
Lecture 22 Introduction to Genetic Algorithms Thursday 14 November 2002 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Readings: Sections 9.1-9.4, Mitchell Chapter 1, Sections
Representation and Hidden Bias II: Eliminating Defining Length Bias in Genetic Search via Shuffle Crossover
Representation and Hidden Bias II: Eliminating Defining Length Bias in Genetic Search via Shuffle Crossover Abstract The traditional crossover operator used in genetic search exhibits a position-dependent
Evolutionary computation
Evolutionary computation Andrea Roli andrea.roli@unibo.it DEIS Alma Mater Studiorum Università di Bologna Evolutionary computation p. 1 Evolutionary Computation Evolutionary computation p. 2 Evolutionary
Introduction to Evolutionary Computation
Introduction to Evolutionary Computation 1 Evolutionary Computation Different lines of investigation in simulated evolution GA (Genetic Algorithms) ES (Evolution Strategies) EP (Evolutionary Programming)
Genetic Engineering and Creative Design
Genetic Engineering and Creative Design Background genes, genotype, phenotype, fitness Connecting genes to performance in fitness Emergent gene clusters evolved genes MIT Class 4.208 Spring 2002 Evolution
Evolutionary Computation
Evolutionary Computation - Computational procedures patterned after biological evolution. - Search procedure that probabilistically applies search operators to set of points in the search space. - Lamarck
0 o 1 i B C D 0/1 0/ /1
A Comparison of Dominance Mechanisms and Simple Mutation on Non-Stationary Problems Jonathan Lewis,? Emma Hart, Graeme Ritchie Department of Articial Intelligence, University of Edinburgh, Edinburgh EH
Induction of Decision Trees
Induction of Decision Trees Peter Waiganjo Wagacha This notes are for ICS320 Foundations of Learning and Adaptive Systems Institute of Computer Science University of Nairobi PO Box 30197, 00200 Nairobi.
Searching the Subsumption Lattice by a Genetic Algorithm
Searching the Subsumption Lattice by a Genetic Algorithm Alireza Tamaddoni-Nezhad and Stephen H. Muggleton Department of Computer Science University of York, York, YO1 5DD, UK {alireza,stephen}@cs.york.ac.uk
CSC 4510 Machine Learning
10: Gene(c Algorithms CSC 4510 Machine Learning Dr. Mary Angela Papalaskari Department of CompuBng Sciences Villanova University Course website: www.csc.villanova.edu/~map/4510/ Slides of this presenta(on
An Analysis of Diploidy and Dominance in Genetic Algorithms
An Analysis of Diploidy and Dominance in Genetic Algorithms Dan Simon Cleveland State University Department of Electrical and Computer Engineering Cleveland, Ohio d.j.simon@csuohio.edu Abstract The use
Evolutionary computation
Evolutionary computation Andrea Roli andrea.roli@unibo.it Dept. of Computer Science and Engineering (DISI) Campus of Cesena Alma Mater Studiorum Università di Bologna Outline 1 Basic principles 2 Genetic
Binary Particle Swarm Optimization with Crossover Operation for Discrete Optimization
Binary Particle Swarm Optimization with Crossover Operation for Discrete Optimization Deepak Singh Raipur Institute of Technology Raipur, India Vikas Singh ABV- Indian Institute of Information Technology
biologically-inspired computing lecture 18
Informatics -inspired lecture 18 Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays
Implicit Formae in Genetic Algorithms
Implicit Formae in Genetic Algorithms Márk Jelasity ½ and József Dombi ¾ ¾ ½ Student of József Attila University, Szeged, Hungary jelasity@inf.u-szeged.hu Department of Applied Informatics, József Attila
Crossover Gene Selection by Spatial Location
Crossover Gene Selection by Spatial Location ABSTRACT Dr. David M. Cherba Computer Science Department Michigan State University 3105 Engineering Building East Lansing, MI 48823 USA cherbada@cse.msu.edu
Mating Restriction and Niching Pressure: Results from Agents and Implications for General EC
Mating Restriction and Niching Pressure: Results from Agents and Implications for General EC R.E. Smith and Claudio Bonacina The Intelligent Computer Systems Centre, Faculty of Computing Engineering, and
Lecture 9 Evolutionary Computation: Genetic algorithms
Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Simulation of natural evolution Genetic algorithms Case study: maintenance scheduling with genetic
Sorting Network Development Using Cellular Automata
Sorting Network Development Using Cellular Automata Michal Bidlo, Zdenek Vasicek, and Karel Slany Brno University of Technology, Faculty of Information Technology Božetěchova 2, 61266 Brno, Czech republic
Evolving more efficient digital circuits by allowing circuit layout evolution and multi-objective fitness
Evolving more efficient digital circuits by allowing circuit layout evolution and multi-objective fitness Tatiana Kalganova Julian Miller School of Computing School of Computing Napier University Napier
Search. Search is a key component of intelligent problem solving. Get closer to the goal if time is not enough
Search Search is a key component of intelligent problem solving Search can be used to Find a desired goal if time allows Get closer to the goal if time is not enough section 11 page 1 The size of the search
Genetic Algorithms: Basic Principles and Applications
Genetic Algorithms: Basic Principles and Applications C. A. MURTHY MACHINE INTELLIGENCE UNIT INDIAN STATISTICAL INSTITUTE 203, B.T.ROAD KOLKATA-700108 e-mail: murthy@isical.ac.in Genetic algorithms (GAs)
Looking Under the EA Hood with Price s Equation
Looking Under the EA Hood with Price s Equation Jeffrey K. Bassett 1, Mitchell A. Potter 2, and Kenneth A. De Jong 1 1 George Mason University, Fairfax, VA 22030 {jbassett, kdejong}@cs.gmu.edu 2 Naval
Gecco 2007 Tutorial / Grammatical Evolution
Gecco 2007 Grammatical Evolution Tutorial Conor Ryan Biocomputing and Developmental Systems Group Department of Computer Science and Information Systems University of Limerick Copyright is held by the
V. Evolutionary Computing. Read Flake, ch. 20. Genetic Algorithms. Part 5A: Genetic Algorithms 4/10/17. A. Genetic Algorithms
V. Evolutionary Computing A. Genetic Algorithms 4/10/17 1 Read Flake, ch. 20 4/10/17 2 Genetic Algorithms Developed by John Holland in 60s Did not become popular until late 80s A simplified model of genetics
Computational Intelligence Winter Term 2018/19
Computational Intelligence Winter Term 2018/19 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund Three tasks: 1. Choice of an appropriate problem
DRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT --
Conditions for the Convergence of Evolutionary Algorithms Jun He and Xinghuo Yu 1 Abstract This paper presents a theoretical analysis of the convergence conditions for evolutionary algorithms. The necessary
Polynomial Approximation of Survival Probabilities Under Multi-point Crossover
Polynomial Approximation of Survival Probabilities Under Multi-point Crossover Sung-Soon Choi and Byung-Ro Moon School of Computer Science and Engineering, Seoul National University, Seoul, 151-74 Korea
Artificial Intelligence (AI) Common AI Methods. Training. Signals to Perceptrons. Artificial Neural Networks (ANN) Artificial Intelligence
Artificial Intelligence (AI) Artificial Intelligence AI is an attempt to reproduce intelligent reasoning using machines * * H. M. Cartwright, Applications of Artificial Intelligence in Chemistry, 1993,
On the Effects of Locality in a Permutation Problem: The Sudoku Puzzle
On the Effects of Locality in a Permutation Problem: The Sudoku Puzzle Edgar Galván-López and Michael O Neill Abstract We present an analysis of an application of Evolutionary Computation to the Sudoku
Data Warehousing & Data Mining
13. Meta-Algorithms for Classification Data Warehousing & Data Mining Wolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 13.
Genetic Algorithm: introduction
1 Genetic Algorithm: introduction 2 The Metaphor EVOLUTION Individual Fitness Environment PROBLEM SOLVING Candidate Solution Quality Problem 3 The Ingredients t reproduction t + 1 selection mutation recombination
Gene Pool Recombination in Genetic Algorithms
Gene Pool Recombination in Genetic Algorithms Heinz Mühlenbein GMD 53754 St. Augustin Germany muehlenbein@gmd.de Hans-Michael Voigt T.U. Berlin 13355 Berlin Germany voigt@fb10.tu-berlin.de Abstract: A
Busy Beaver The Influence of Representation
Busy Beaver The Influence of Representation Penousal Machado *, Francisco B. Pereira *, Amílcar Cardoso **, Ernesto Costa ** Centro de Informática e Sistemas da Universidade de Coimbra {machado, xico,
Quantitative Genetics I: Traits controlled my many loci. Quantitative Genetics: Traits controlled my many loci
Quantitative Genetics: Traits controlled my many loci So far in our discussions, we have focused on understanding how selection works on a small number of loci (1 or 2). However in many cases, evolutionary
Quantitative Trait Variation
Quantitative Trait Variation 1 Variation in phenotype In addition to understanding genetic variation within at-risk systems, phenotype variation is also important. reproductive fitness traits related to
Variance Components: Phenotypic, Environmental and Genetic
Variance Components: Phenotypic, Environmental and Genetic You should keep in mind that the Simplified Model for Polygenic Traits presented above is very simplified. In many cases, polygenic or quantitative
Lecture 06: Niching and Speciation (Sharing)
Xin Yao 1 Lecture 06: Niching and Speciation (Sharing) 1. Review of the last lecture Constraint handling using the penalty and repair methods Stochastic ranking for constraint handling 2. Why niching 3.
Development. biologically-inspired computing. lecture 16. Informatics luis rocha x x x. Syntactic Operations. biologically Inspired computing
lecture 16 -inspired S S2 n p!!! 1 S Syntactic Operations al Code:N Development x x x 1 2 n p S Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms
Improved TBL algorithm for learning context-free grammar
Proceedings of the International Multiconference on ISSN 1896-7094 Computer Science and Information Technology, pp. 267 274 2007 PIPS Improved TBL algorithm for learning context-free grammar Marcin Jaworski
Applying Price s Equation to Survival Selection
Applying Price s Equation to Survival Selection Jeffrey K. Bassett George Mason University Krasnow Institute, MS2A1 4400 University Dr. Fairfax, VA 22030 jbassett@cs.gmu.edu Mitchell A. Potter Naval Research
Matrix Analysis of Genetic Programming Mutation
See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/255568988 Matrix Analysis of Genetic Programming Mutation Article in Lecture Notes in Computer
Database Theory VU , SS Complexity of Query Evaluation. Reinhard Pichler
Database Theory Database Theory VU 181.140, SS 2018 5. Complexity of Query Evaluation Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 17 April, 2018 Pichler
The Story So Far... The central problem of this course: Smartness( X ) arg max X. Possibly with some constraints on X.
Heuristic Search The Story So Far... The central problem of this course: arg max X Smartness( X ) Possibly with some constraints on X. (Alternatively: arg min Stupidness(X ) ) X Properties of Smartness(X)
V. Evolutionary Computing. Read Flake, ch. 20. Assumptions. Genetic Algorithms. Fitness-Biased Selection. Outline of Simplified GA
Part 5A: Genetic Algorithms V. Evolutionary Computing A. Genetic Algorithms Read Flake, ch. 20 1 2 Genetic Algorithms Developed by John Holland in 60s Did not become popular until late 80s A simplified
Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage
Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage Kumara Sastry 1,2 and David E. Goldberg 1,3 1 Illinois Genetic Algorithms Laboratory (IlliGAL) 2 Department of Material
Theme Preservation and the Evolution of Representation
Theme reservation and the Evolution of Representation Keki Burjorjee and Jordan ollack Demo Lab, Computer Science Department MS018, Brandeis University, Waltham, MA 02454, USA {kekib, pollack}@cs.brandeis.edu
Interpreting Low and High Order Rules: A Granular Computing Approach
Interpreting Low and High Order Rules: A Granular Computing Approach Yiyu Yao, Bing Zhou and Yaohua Chen Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail:
IV. Evolutionary Computing. Read Flake, ch. 20. Assumptions. Genetic Algorithms. Fitness-Biased Selection. Outline of Simplified GA
IV. Evolutionary Computing A. Genetic Algorithms Read Flake, ch. 20 2014/2/26 1 2014/2/26 2 Genetic Algorithms Developed by John Holland in 60s Did not become popular until late 80s A simplified model
Repeated Occurrences of the Baldwin Effect Can Guide Evolution on Rugged Fitness Landscapes
Repeated Occurrences of the Baldwin Effect Can Guide Evolution on Rugged Fitness Landscapes Reiji Suzuki and Takaya Arita Graduate School of Information Science, Nagoya University Furo-cho, Chikusa-ku,
Gaussian EDA and Truncation Selection: Setting Limits for Sustainable Progress
Gaussian EDA and Truncation Selection: Setting Limits for Sustainable Progress Petr Pošík Czech Technical University, Faculty of Electrical Engineering, Department of Cybernetics Technická, 66 7 Prague
XCSF with Local Deletion: Preventing Detrimental Forgetting
XCSF with Local Deletion: Preventing Detrimental Forgetting ABSTRACT Martin V. Butz Department of Psychology III University of Würzburg Röntgenring 977 Würzburg, Germany butz@psychologie.uni-wuerzburg.de
Choose a category. You will be given the answer. You must give the correct question. Click to begin.
Choose a category. You will be given the answer. You must give the correct question. Click to begin. Click here for Final Jeopardy Classify This For Cell Gene Gene the Dancin Machine Cycles & Changes Feed
The Role of Crossover in Genetic Algorithms to Solve Optimization of a Function Problem Falih Hassan
The Role of Crossover in Genetic Algorithms to Solve Optimization of a Function Problem Falih Hassan ABSTRACT The genetic algorithm is an adaptive search method that has the ability for a smart search
Determination of Optimal Tightened Normal Tightened Plan Using a Genetic Algorithm
Journal of Modern Applied Statistical Methods Volume 15 Issue 1 Article 47 5-1-2016 Determination of Optimal Tightened Normal Tightened Plan Using a Genetic Algorithm Sampath Sundaram University of Madras,
Probability (Phi) Proportion BBs (Pbb) 1. Proportion BBs (Pbb) Pop Size (n) Pop Size (n)
THE POPULATION SIZING PROBLEM IN (P)GAS Zden»ek Konfr»st Department of Cybernetics, Czech Technical University Abstract One of interesting problems in genetic algorithms (GAs) is the population sizing
A Demonstration of Neural Programming Applied to Non-Markovian Problems
A Demonstration of Neural Programming Applied to Non-Markovian Problems Gabriel Catalin Balan and Sean Luke George Mason University, Fairfax, VA 00 gbalan@cs.gmu.edu, sean@cs.gmu.edu Abstract. Genetic
New Epistasis Measures for Detecting Independently Optimizable Partitions of Variables
New Epistasis Measures for Detecting Independently Optimizable Partitions of Variables Dong-Il Seo, Sung-Soon Choi, and Byung-Ro Moon School of Computer Science & Engineering, Seoul National University
Towards Automatic Design of Adaptive Evolutionary Algorithms. Ayman Srour - Patrick De Causmaecker
Towards Automatic Design of Adaptive Evolutionary Algorithms Ayman Srour - Patrick De Causmaecker Outline Background Parameter tuning Adaptive Parameter control Preliminary investigation The proposed framework
Partitioning Genetic Variance
PSYC 510: Partitioning Genetic Variance (09/17/03) 1 Partitioning Genetic Variance Here, mathematical models are developed for the computation of different types of genetic variance. Several substantive
Effects of the Use of Non-Geometric Binary Crossover on Evolutionary Multiobjective Optimization
Effects of the Use of Non-Geometric Binary Crossover on Evolutionary Multiobjective Optimization Hisao Ishibuchi, Yusuke Nojima, Noritaka Tsukamoto, and Ken Ohara Graduate School of Engineering, Osaka
Quantitative Genomics and Genetics BTRY 4830/6830; PBSB
Quantitative Genomics and Genetics BTRY 4830/6830; PBSB.5201.01 Lecture 20: Epistasis and Alternative Tests in GWAS Jason Mezey jgm45@cornell.edu April 16, 2016 (Th) 8:40-9:55 None Announcements Summary
Quantitative characters II: heritability
Quantitative characters II: heritability The variance of a trait (x) is the average squared deviation of x from its mean: V P = (1/n)Σ(x-m x ) 2 This total phenotypic variance can be partitioned into components:
Bias and No Free Lunch in Formal Measures of Intelligence
Journal of Artificial General Intelligence 1 (2009) 54-61 Submitted 2009-03-14; Revised 2009-09-25 Bias and No Free Lunch in Formal Measures of Intelligence Bill Hibbard University of Wisconsin Madison
Evolution of Genotype-Phenotype mapping in a von Neumann Self-reproduction within the Platform of Tierra
Evolution of Genotype-Phenotype mapping in a von Neumann Self-reproduction within the Platform of Tierra Declan Baugh and Barry Mc Mullin The Rince Institute, Dublin City University, Ireland declan.baugh2@mail.dcu.ie,
Entropy Rate of Stochastic Processes
Entropy Rate of Stochastic Processes Timo Mulder tmamulder@gmail.com Jorn Peters jornpeters@gmail.com February 8, 205 The entropy rate of independent and identically distributed events can on average be
Effect of Rule Weights in Fuzzy Rule-Based Classification Systems
506 IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 9, NO. 4, AUGUST 2001 Effect of Rule Weights in Fuzzy Rule-Based Classification Systems Hisao Ishibuchi, Member, IEEE, and Tomoharu Nakashima, Member, IEEE
Selection Page 1 sur 11. Atlas of Genetics and Cytogenetics in Oncology and Haematology SELECTION
Selection Page 1 sur 11 Atlas of Genetics and Cytogenetics in Oncology and Haematology SELECTION * I- Introduction II- Modeling and selective values III- Basic model IV- Equation of the recurrence of allele
CC283 Intelligent Problem Solving 28/10/2013
Machine Learning What is the research agenda? How to measure success? How to learn? Machine Learning Overview Unsupervised Learning Supervised Learning Training Testing Unseen data Data Observed x 1 x
Dilated Floor Functions and Their Commutators
Dilated Floor Functions and Their Commutators Jeff Lagarias, University of Michigan Ann Arbor, MI, USA (December 15, 2016) Einstein Workshop on Lattice Polytopes 2016 Einstein Workshop on Lattice Polytopes
Data Mining Prof. Pabitra Mitra Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur
Data Mining Prof. Pabitra Mitra Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture 21 K - Nearest Neighbor V In this lecture we discuss; how do we evaluate the
Chapter 13 Meiosis and Sexual Reproduction
Biology 110 Sec. 11 J. Greg Doheny Chapter 13 Meiosis and Sexual Reproduction Quiz Questions: 1. What word do you use to describe a chromosome or gene allele that we inherit from our Mother? From our Father?
Learning Communication for Multi-agent Systems
Learning Communication for Multi-agent Systems C. Lee Giles 1,2 and Kam-Chuen Jim 2 1 School of Information Sciences & Technology and Computer Science and Engineering The Pennsylvania State University
Computational Complexity and Genetic Algorithms
Computational Complexity and Genetic Algorithms BART RYLANDER JAMES FOSTER School of Engineering Department of Computer Science University of Portland University of Idaho Portland, Or 97203 Moscow, Idaho
A GENETIC ALGORITHM FOR FINITE STATE AUTOMATA
A GENETIC ALGORITHM FOR FINITE STATE AUTOMATA Aviral Takkar Computer Engineering Department, Delhi Technological University( Formerly Delhi College of Engineering), Shahbad Daulatpur, Main Bawana Road,
Algorithmic probability, Part 1 of n. A presentation to the Maths Study Group at London South Bank University 09/09/2015
Algorithmic probability, Part 1 of n A presentation to the Maths Study Group at London South Bank University 09/09/2015 Motivation Effective clustering the partitioning of a collection of objects such
Evolutionary Algorithms: Introduction. Department of Cybernetics, CTU Prague.
Evolutionary Algorithms: duction Jiří Kubaĺık Department of Cybernetics, CTU Prague http://cw.felk.cvut.cz/doku.php/courses/a4m33bia/start pcontents 1. duction to Evolutionary Algorithms (EAs) Pioneers
Lecture WS Evolutionary Genetics Part I 1
Quantitative genetics Quantitative genetics is the study of the inheritance of quantitative/continuous phenotypic traits, like human height and body size, grain colour in winter wheat or beak depth in
THE PROBLEM OF locating all the optima within a fitness
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 11, NO. 4, AUGUST 2007 453 Where Are the Niches? Dynamic Fitness Sharing Antonio Della Cioppa, Member, IEEE, Claudio De Stefano, and Angelo Marcelli,
Model Complexity of Pseudo-independent Models
Model Complexity of Pseudo-independent Models Jae-Hyuck Lee and Yang Xiang Department of Computing and Information Science University of Guelph, Guelph, Canada {jaehyuck, yxiang}@cis.uoguelph,ca Abstract
Shortening Picking Distance by using Rank-Order Clustering and Genetic Algorithm for Distribution Centers
Shortening Picking Distance by using Rank-Order Clustering and Genetic Algorithm for Distribution Centers Rong-Chang Chen, Yi-Ru Liao, Ting-Yao Lin, Chia-Hsin Chuang, Department of Distribution Management,
Spurious Dependencies and EDA Scalability
Spurious Dependencies and EDA Scalability Elizabeth Radetic, Martin Pelikan MEDAL Report No. 2010002 January 2010 Abstract Numerous studies have shown that advanced estimation of distribution algorithms
A comparison of evolutionary and coevolutionary search
A comparison of evolutionary and coevolutionary search Ludo Pagie Santa Fe Institute 1399 Hyde Park Road Santa Fe, NM87501, US ludo@santafe.edu Melanie Mitchell Santa Fe Institute 1399 Hyde Park Road Santa
Chapter 8: Introduction to Evolutionary Computation
Computational Intelligence: Second Edition Contents Some Theories about Evolution Evolution is an optimization process: the aim is to improve the ability of an organism to survive in dynamically changing
An Evolution Strategy for the Induction of Fuzzy Finite-state Automata
Journal of Mathematics and Statistics 2 (2): 386-390, 2006 ISSN 1549-3644 Science Publications, 2006 An Evolution Strategy for the Induction of Fuzzy Finite-state Automata 1,2 Mozhiwen and 1 Wanmin 1 College
A New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms
A New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms Yang Yu and Zhi-Hua Zhou National Laboratory for Novel Software Technology Nanjing University, Nanjing 20093, China
Overview of ECNN Combinations
1 Overview of ECNN Combinations Evolutionary Computation ECNN Neural Networks by Paulo Cortez and Miguel Rocha pcortez@dsi.uminho.pt mrocha@di.uminho.pt (Presentation available at: http://www.dsi.uminho.pt/
Choosing Variables with a Genetic Algorithm for Econometric models based on Neural Networks learning and adaptation.
Choosing Variables with a Genetic Algorithm for Econometric models based on Neural Networks learning and adaptation. Daniel Ramírez A., Israel Truijillo E. LINDA LAB, Computer Department, UNAM Facultad
An Improved Quantum Evolutionary Algorithm with 2-Crossovers
An Improved Quantum Evolutionary Algorithm with 2-Crossovers Zhihui Xing 1, Haibin Duan 1,2, and Chunfang Xu 1 1 School of Automation Science and Electrical Engineering, Beihang University, Beijing, 100191,