Schema (genetic algorithms): Difference between revisions

Revision as of 10:27, 13 November 2014

Revision as of 18:00, 10 January 2016

Line 1:

{{merge from|Propagation of schema|date=December 2011}}

A '''schema''' is a template in [[computer science]] used in the field of [[genetic algorithm]]s that identifies a [[subset]] of strings with similarities at certain string positions. Schemata are a special case of [[cylinder set]]s; and so form a [[topological space]].<ref name="Holland1">{{cite book |title=Adaptation in Natural and Artificial Systems|year=1992|edition=reprint|publisher=The MIT Press|author=Holland, John Henry |ISBN=9780472084609 |URL=http://books.google.com/books/about/Adaptation_in_natural_and_artificial_sys.html?id=JE5RAAAAMAAJ |deadurl=no |accessdate=22 April 2014}}</ref>

Line 10 ⟶ 9:

===Disruption===

If the child of an individual that matches schema H does not ''itself'' match H, the schema is said to have been ''disrupted''.<ref name="UCL1" />

==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 (genetic algorithms)|schema]] is propagated if individuals in the current generation match it and so do those in the next generation. Those in the next generation may be (but don't have to be) children of parents who matched it.

==See also==