Abstract
The facetwise approach to GA theory stresses effective mixing and decision making among BBs. The last chapter showed that in XCS, BBs are subsets of specified attributes that increase accuracy. The reproductive opportunity bound additionally ensures that BBs are able to grow in the population making time for the identification and reproduction of schema representatives. Until now, we assumed that mutation is sufficient to generate better classifiers as investigated in the time bound. However, the GA literature suggests that effective crossover operators are mandatory to solve boundedly difficulty optimization problems in which small, lower-level BBs may mislead the population to a local optimum.
Keywords
- Bayesian Network
- Dependency Structure
- Crossover Operator
- Uniform Crossover
- Conditional Probability Table
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this chapter
Cite this chapter
Butz, M.V. (2006). Effective XCS Search: Building Block Processing. In: Rule-Based Evolutionary Online Learning Systems. Studies in Fuzziness and Soft Computing, vol 191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31231-5_7
Download citation
DOI: https://doi.org/10.1007/3-540-31231-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25379-2
Online ISBN: 978-3-540-31231-4
eBook Packages: EngineeringEngineering (R0)