Relational Representation in XCSF

Authors: Mohammad Ali Tabarzad, Caro Lucas, Ali Hamzeh

Abstract:

Generalization is one of the most challenging issues of Learning Classifier Systems. This feature depends on the representation method which the system used. Considering the proposed representation schemes for Learning Classifier System, it can be concluded that many of them are designed to describe the shape of the region which the environmental states belong and the other relations of the environmental state with that region was ignored. In this paper, we propose a new representation scheme which is designed to show various relationships between the environmental state and the region that is specified with a particular classifier.

Keywords: Classifier Systems, Reinforcement Learning, Relational Representation, XCSF.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1085473

References:

[1] J.H. Holland, 1986, Escaping Brittleness: The Possibilities of General- Purpose Learning Algorithms Applied to Parallel Rule-Based Systems, Machine Learning: An Artificial Intelligence Approach, Volume II, Michalski, Ryszard S., Carbonell, Jamie G., and Mitchell, Tom M. (eds.), Morgan Kaufman Publishers, Inc., Los Altos, CA.
[2] S. W. Wilson, 1995, Classifier Fitness Based on Accuracy, Evolutionary Computation, 3(2):149-175.
[3] S.W. Wilson, 2001, Function Approximation with a Classifier System, In proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), San Francisco, California, USA, pp. 974-981. Morgan Kaufmann.
[4] P. L. Lanzi, D. Loiacono, S. W. Wilson, and D. E. Goldberg, 2005, XCS with Computed Prediction for the Learning of Boolean Functions, In Proceedings of the IEEE Congress on Evolutionary Computation - CEC-2005, Edinburgh, UK.
[5] S. W. Wilson, 1996, Mining Oblique Data with XCS, volume 1996 of Lecture notes in Computer Science, pages 158-174. Springer-Verlag, Apr. 2001.
[6] M. V. Butz, 2005, Kernel-based, Ellipsoidal Conditions in the Real- Valued XCS Classifier System, In Proceedings of the 2005 conference on Genetic and evolutionary computation, volume 2, pages 1835-1842, Washington DC, USA.
[7] S.W. Wilson, P.L. Lanzi, 2005, Classifier Conditions based on Convex Hulls, IlliGAL Report No. 2005024, November.
[8] B. Widrow, M. E. Hoff, 1988, Adaptive Switching Circuits, chapter Neurocomputing: Foundation of Research, pages 126-134. The MIT Press, Cambridge.
[9] P.L. Lanzi, D. Loiacono, S. W. Wilson, and D. E. Goldberg. Generalization in the xcsf classifier system: Analysis, improvement, and extension, 2005, Technical Report 2005012, Illinois Genetic Algorithms Laboratory - University of Illinois at Urbana-Champaign.
[10] S.W. Wilson, 1999, Get real! XCS with continuous-valued inputs, From Festschrift in Honor of John H. Holland, May 15-18, 1999 (pp. 111- 121), L. Booker, S. Forrest, M. Mitchell, and R. Riolo (eds.). Center for the Study of Complex Systems, The University of Michigan, Ann Arbor, MI.
[11] C. Stone, L. Bull, 2003, For real! XCS with Continuous-Valued Inputs, Evolutionary Computation, 11(3):299--336.
[12] S. W. Wilson, 2004, Classifier Systems for Continuous Payoff Environments. In Proceeding of Genetic and Evolutionary Computation - GECCO-2004, Part II, volume 3103 of Lecture Notes in Computer Science, pages 824-835, Seattle, WA, USA, 26-30 June 2004. Springer- Verlag.
[13] G. Kanji, 1994, 100 Statistical Tests, SAGE Publications.