Schema (genetic algorithms)
- Schema (genetic algorithms)
-
A schema is a template in computer science used in the field of genetic algorithms that identifies a subset of strings with similarities at certain string positions. Schemata are a special case of cylinder sets; and so form a topological space.[1]
Description
For example, consider binary strings of length 6. The schema 1**0*1 describes the set of all words of length 6 with 1's at positions 1 and 6 and a 0 at position 4. The * is a wildcard symbol, which means that positions 2, 3 and 5 can have a value of either 1 or 0. The order of a schema is defined as the number of fixed positions in the template, while the defining length δ(H) is the distance between the first and last specific positions. The order of 1**0*1 is 3 and its defining length is 5. The fitness of a schema is the average fitness of all strings matching the schema. The fitness of a string is a measure of the value of the encoded problem solution, as computed by a problem-specific evaluation function.
Length
The length of a schema H, called N(H), is defined as the total number of nodes in the schema. N(H) is also equal to the number of nodes in the programs matching H.[2]
Disruption
If the child of an individual that matches schema H does not itself match H, the schema is said to have been disrupted.[2]
See also
References
Categories:
- Bioinformatics stubs
- Artificial intelligence stubs
- Computer science stubs
- Genetic algorithms
- Genetic programming
Wikimedia Foundation.
2010.
Look at other dictionaries:
Schema — The word schema comes from the Greek word σχήμα (skhēma), which means shape, or more generally, plan . The Greek plural is σχήματα (skhēmata). In English, both schemas and schemata are used as plural forms, although the latter is the standard… … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
Genetic programming — In artificial intelligence, genetic programming (GP) is an evolutionary algorithm based methodology inspired by biological evolution to find computer programs that perform a user defined task. It is a specialization of genetic algorithms where… … Wikipedia
Holland's schema theorem — is widely taken to be the foundation for explanations of the power of genetic algorithms.A schema is a template that identifies a subset of strings with similarities at certain string positions. Schemata are a special case of cylinder sets; and… … Wikipedia
Disruption (of schema) — In genetic algorithms or genetic programming if the child of an individual that matches schema H does not itself match H, the schema is said to have been disrupted.References* [http://www.cs.ucl.ac.uk/staff/W.Langdon/FOGP/ Foundations of Genetic… … Wikipedia
Propagation of schema — In evolutionary computing such as genetic algorithms and genetic programming, propagation refers to the inheritance of characteristics of one generation by the next. For example, a schema is propagated if individuals in the current generation… … Wikipedia
Metaheuristic — In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the… … Wikipedia
Clinical decision support system — (CDSS or CDS) is an interactive decision support system (DSS) Computer Software, which is designed to assist physicians and other health professionals with decision making tasks, as determining diagnosis of patient data. A working definition has… … Wikipedia
Defining length — In genetic algorithms and genetic programming defining length L(H) is the maximum distance between two defining symbols (that is symbols that have a fixed value as opposed to symbols that can take any value, commonly denoted as # or *) in schema… … Wikipedia
Data mining — Not to be confused with analytics, information extraction, or data analysis. Data mining (the analysis step of the knowledge discovery in databases process,[1] or KDD), a relatively young and interdisciplinary field of computer science[2][3] is… … Wikipedia
