|
ABSTRACT
Motivated by the intention to increase the expressive power of learning classifier systems, we developed a new Xcs derivative, Fox-cs, where the classifier and observation languages are a subset of first order logic. We found that Fox-cs was viable at tasks in two relational task domains, poker and blocks world, which cannot be represented easily using traditional bit-string classifiers and inputs. We also found that for these tasks, the level of generality obtained by Fox-cs in the portion of population that produces optimal behaviour is consistent with Wilson's generality hypothesis.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
M. Ahluwalia and L. Bull. A genetic programming-based classi . er system. In Banzhaf et al. {2} , pages 11--18.
|
| |
2
|
W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors. GECCO'99: Proceedings of the Genetic and Evolutionary Computation Conference Morgan Kaufmann, 1999.
|
| |
3
|
|
| |
4
|
|
| |
5
|
L. B. Booker. Representing attribute-based concepts in a classifier system. In G. J. E. Rawlins, editor, Proceedings of the First Workshop on Foundations of Genetic Algorithms (FOGA91)pages 115--127, San-Maeto, 1991. Morgan Kaufmann.
|
| |
6
|
|
| |
7
|
M. V. Butz and S. W. Wilson. An algorithmic description of XCS. Soft Computing 6(3--4):144--153, 2002.
|
| |
8
|
|
| |
9
|
|
| |
10
|
J. H. Holland. Escaping brittleness:the possibilities of general-purpose learning algorithms applied to parallel rule-based systems. In R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, editors, Machine Learning, an Artificial Intelligence Approach pages 593--623, Los Altos, California, 1986. Morgan Kaufmann.
|
| |
11
|
W. V. Laer. From Propositional to First Order Logic in Machine Learning and Data Mining PhDthesis, Katholieke Universiteit Leuven, 2002.
|
| |
12
|
P. L. Lanzi. Extending the representation of classifier conditions, part II: From messy codings to S-expressions. In Banzhaf et al. {2} , pages 345--352.
|
| |
13
|
|
| |
14
|
S. Muggleton. Inductive Logic Programming. In The MIT Encyclopedia of the Cognitive Sciences (MITECS) Academic Press, 1992.
|
| |
15
|
|
| |
16
|
|
| |
17
|
|
| |
18
|
|
| |
19
|
|
| |
20
|
P. Tadepalli, R. Givan, and K. Driessens, editors. Proceedings of the ICML'04 Workshop on Relational Reinforcement Learning 2004. http://eecs. oregonstate. edu/research/rrl/index. html.
|
| |
21
|
|
| |
22
|
S. W. Wilson. Classifier . tness based on accuracy. Evolutionary Computation 3(2):149--175, 1995.
|
| |
23
|
S. W. Wilson. Generalization in the XCS classifier system. In Genetic Programming 1998: Proceedings of the Third Annual Conference pages 665--674, University of Wisconsin, Madison, Wisconsin, USA, 1998. Morgan Kaufmann.
|
| |
24
|
|
|