On accuracy-based fitness
Learning classifier systems use genetic algorithms to facilitate rule-discovery, where rule fitness has traditionally been payoff prediction-based. Current research has shifted to the use of accuracy-based fitness. This paper presents a simple Markov model of the algorithm in such systems, allowing comparison between the two forms of rule utility measure. Using a single-step task the previously discussed benefits of accuracy over prediction are clearly shown with regard to overgeneral rules. The effects of a niche-based algorithm (maximal generality) are also briefly examined, as are the effects of mutation under the two fitness schemes. Finally, the behaviour of the genetic algorithm during the solution of multi-step tasks is investigated.
- scientific article; zbMATH DE number 5587350
- The optimal accuracy level in asymmetric contests
- On the tradeoff between stability and fit
- Complexity in the case against accuracy estimation
- scientific article; zbMATH DE number 1664964
- scientific article; zbMATH DE number 2247480
- scientific article; zbMATH DE number 165182
- A formal framework and extensions for function approximation in learning classifier systems
- A fitness based analysis of Daisyworld
- Towards a theory of strong overgeneral classifiers
- scientific article; zbMATH DE number 2040737 (Why is no real title available?)
- scientific article; zbMATH DE number 2087896 (Why is no real title available?)
- scientific article; zbMATH DE number 2087898 (Why is no real title available?)
- Two-step Markov update algorithm for accuracy-based learning classifier systems
This page was built for publication: On accuracy-based fitness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864375)