Pier Luca Lanzi. Extending the representation of classifier conditions. Part II: From messy coding to S-expressions. In Wolfgang Banzhaf, editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), pages 345--352, San Francisco, CA, 1999. Morgan Kaufmann.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....XCS [15] LCS traditionally incorporate a binary rule representation, augmented with wildcard symbols to allow for generalizations. Recently, a number of investigations have made use of other rule condition representations, including real numbers [16] messy GAs [9] logical S expressions [10], and those where the output is a function of the input, including numerical S expressions [1] and fuzzy logic [e.g. 14] We present a neural network based scheme, where each rule s condition and action are represented by a multi layered perceptron (MLP) The weights of each neural rule being ....

Lanzi, P-L (1999) Extending the Representation of Classifier Conditions Part II: From Messy Coding to S-Expressions. In W. Banzhaf, J. Daida, A.E. Eiben, M.H. Garzon, V. Honavar, M. Jakiela & R.E. Smith (eds) Proceedings of the Genetic and Evolutionary Computation Conference -- GECCO-99. Morgan Kaufmann, pp11-18.

....paradigm into the accuracy based XCS [15] LCS traditionally incorporate a binary rule representation, augmented with wildcard symbols to allow for generalizations. Recently, a number of investigations have made use of other rule condition representations, including real numbers [16] messy GAs [9], logical S expressions [10] and those where the output is a function of the input, including numerical S expressions [1] and fuzzy logic [e.g. 14] We present a neural network based scheme, where each rule s condition and action are represented by a multi layered perceptron (MLP) The weights of ....

Lanzi, P-L (1999) Extending the Representation of Classifier Conditions Part I: From Binary to Messy Coding. In W. Banzhaf, J. Daida, A.E. Eiben, M.H. Garzon, V. Honavar, M. Jakiela & R.E. Smith (eds) Proceedings of the Genetic and Evolutionary Computation Conference -- GECCO-99. Morgan Kaufmann, pp11-18.

....can only approximate the shape. Many classifiers may be required, and the shape may be difficult to see in the classifiers. One approach to oblique problems is to modify the syntax of classifier conditions so that oblique DS s can be approximated. The most general method is to use S classifiers (Lanzi 1999; Wilson 1994) where the conditions are Lisp S expression predicates and can be based on arithmetic function primitives. Our aim in this paper, however, is to apply basic XCS (modified for numeric inputs) to oblique data, using the well known Wisconsin Breast Cancer dataset (Blake and Merz 1998) ....

Lanzi, P. L. (1999). Extending the representation of classifier conditions. Part II: From messy coding to S-expressions. See Banzhaf, Daida, Eiben, Garzon, Honavar, Jakiela, and Smith (1999), pp. 345--352.

....potential problems and clarifications. This document should definitely be read in conjunction with some of the basic XCS literature, for example Wilson (1995) Kovacs (1997) and Wilson (1998) Additional papers on XCS and other LCSs, together with a complete LCS bibliography, will be found in Lanzi, Stolzmann, and Wilson (2000). Visiting student from the University of Wurzburg, Institute for Psychology III, Germany 1 XCS a(t) t) s r(t) end of problem Reinforcement Program Environment Figure 1: XCS interacts with an environment and a reinforcement program. 2 Environment Interaction, Structures, and ....

Lanzi, P. L. (1999b). Extending the representation of classifier conditions. Part I: From binary to messy coding. In Banzhaf, W. (Ed.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99) (pp. 337--344). Orlando, Florida: Morgan Kaufmann.

....For example, in the problem just mentioned, appropriate primitives would include and . Genetic programming (Koza 1992) has shown in principle how such predicates might be evolved, leading to the suggestion of s classifiers, classifiers with s expression conditions (Wilson 1994) Recently, Lanzi Perrucci (1999) reported learning of the Boolean 6 multiplexer using XCS with sclassifiers. Learning times in terms of number of examples seen were approximately equal to times with the traditional syntax, suggesting perhaps surprisingly that use of s expressions may not bring greater learning complexity. Their ....

....Missing variables are in effect don t cares . The simplest kind of variable length condition would concatenate the variables that are included as an unordered string of variable, value pairs. The format is the same as that employed by Goldberg, Korb Deb (1989) in the messy genetic algorithm. Lanzi (1999a) experimented with this condition format using genetic operators and other techniques similar to those in the messy GA, while leaving unchanged the rest of XCS. After encountering and solving certain problems of under and over specification, Lanzi was able to achieve optimal performance on ....

[Article contains additional citation context not shown here]

Lanzi, P. L. and Perrucci, A. (1999). Extending the representation of classifier conditions, part II: from messy coding to s-expressions. GECCO-99, accepted.

No context found.

Pier Luca Lanzi. Extending the representation of classifier conditions. Part II: From messy coding to S-expressions. In Wolfgang Banzhaf, editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), pages 345--352, San Francisco, CA, 1999. Morgan Kaufmann.

No context found.

Pier Luca Lanzi. Extending the representation of classifier conditions. Part I: From binary to messy coding. In Wolfgang Banzhaf, editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), pages 337--344, San Francisco, CA, 1999. Morgan Kaufmann.

No context found.

Lanzi, P. L. (1999a). Extending the representation of classifier conditions, part I: from binary to messy coding. GECCO-99, accepted.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC