Investigating Scaling of an Abstracted LCS Utilising Ternary and S-Expression Alphabets
- 353 Downloads
Utilising the expressive power of S-Expressions in Learning Classifier Systems often prohibitively increases the search space due to increased flexibility of the encoding. This work shows that selection of appropriate S-Expression functions through domain knowledge improves scaling in problems, as expected. It is also known that simple alphabets perform well on relatively small sized problems in a domain, e.g. ternary alphabet in the 6, 11 and 20 bit MUX domain. Once fit ternary rules have been formed it was investigated whether higher order learning was possible and whether this staged learning facilitated selection of appropriate functions in complex alphabets, e.g. selection of S-Expression functions. This novel methodology is shown to provide compact results (135-MUX) and exhibits potential for scaling well (1034-MUX), but is only a small step towards introducing abstraction to LCS.
KeywordsGenetic Programming Learn Classifier System Accurate Classifier High Order Learning Multiplexer Problem
Unable to display preview. Download preview PDF.
- 3.Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press (1975)Google Scholar
- 4.Wilson, S.W.: Generalization in the XCS Classifier System. In: Koza, J., et al. (eds.) Genetic Programming: Proceedings of the Third Annual Conference, pp. 665–674. Morgan Kaufmann, San Francisco (1998)Google Scholar
- 5.Kovacs, T.: Evolving Optimal Populations with XCS Classifier Systems. MSc Thesis, University of Birmingham. Also Technical Report CSR-96-17 and CSRP-96-17, School of Computer Science, University of Birmingham, Birmingham, UK (1996)Google Scholar
- 6.Kovacs, T.: XCS Classifier System Reliably Evolves Accurate, Complete, and Minimal Representations for Boolean Functions. In: Roy, Chawdhry, Pant. (eds.) Soft Computing in Engineering Design and Manufacturing, pp. 59–68. Springer, Heidelberg (1997)Google Scholar
- 8.Lanzi, P.-L., Perrucci, A.: Extending the Representation of Classifier Conditions Part II: From Messy Coding to S-Expressions. In: Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida, pp. 345–352. Morgan Kaufmann, San Francisco (1999)Google Scholar
- 9.Butz, M.V.: Rule-Based Evolutionary Online Learning Systems: A Principled Approach to LCS Analysis and Design. Studies in Fuzziness and Soft Computing, vol. 191 (2006)Google Scholar
- 12.Browne, W., Scott, D.: An abstraction algorithm for genetics-based reinforcement learning. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1875–1882. ACM Press, Washington (2005)Google Scholar