Schema (genetic algorithms): Difference between revisions

Content deleted Content added
Line 37:
{{cite journal |author=Jack McKay Fletcher and Thomas Wennkers| year=2017 |title=A natural approach to studying schema processing |journal=arXiv preprint arXiv:1705.04536|url=https://arxiv.org/pdf/1705.04536.pdf}} </ref>
 
== The Schematic Completion and theThe Schematic Lattice ==
For a set <math>A \subseteq \Sigma^l</math>, we call the process of calculating the compression on each subset of A, that is <math>\{{\downarrow}X | X \subseteq A\}</math>, the schematic completion of <math>A</math>, denoted <math>\mathcal{S}(A)</math>.<ref name = "Fletcher">
{{cite journal |author=Jack McKay Fletcher and Thomas Wennkers| year=2017 |title=A natural approach to studying schema processing |journal=arXiv preprint arXiv:1705.04536|url=https://arxiv.org/pdf/1705.04536.pdf}} </ref>
Line 52:
The schematic lattice is similar to the concept lattice found in [[Formal concept analysis]].
{{clear}}
 
 
==See also==