Schema (genetic algorithms): Difference between revisions

Content deleted Content added
m cleanup, removed stub tag, typo(s) fixed: For example → For example,, the the → the using AWB
Citation bot (talk | contribs)
m Add: class, url, isbn. Removed parameters. You can use this bot yourself. Report bugs here.
Line 1:
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 |ISBNisbn=9780472084609 |URLurl=https://books.google.com/books/about/Adaptation_in_natural_and_artificial_sys.html?id=JE5RAAAAMAAJ |deadurl=no |accessdate=22 April 2014}}</ref>
 
== Description ==
Line 15:
== The Expansion and Compression Operators ==
Recently schema have been studied using [[order theory]].<ref name = "Fletcher">
{{cite arxiv |author=Jack McKay Fletcher and Thomas Wennkers |year=2017 |title=A natural approach to studying schema processing |eprint=1705.04536|class=cs.NE }}</ref>
 
Two basic operators are defined for schema: expansion and compression. The expansion maps a schema onto a set of words which it represents, while the compression maps a set of words on to a schema.