Genetic Algorithms and Grouping Problems
Genetic Algorithms and Grouping Problems
Improving the Performance of Genetic Algorithms in Classifier Systems
Proceedings of the 1st International Conference on Genetic Algorithms
Strength or Accuracy: Credit Assignment in Learning Classifier Systems
Strength or Accuracy: Credit Assignment in Learning Classifier Systems
Kernel-based, ellipsoidal conditions in the real-valued XCS classifier system
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Classifier fitness based on accuracy
Evolutionary Computation
The lack of a priori distinctions between learning algorithms
Neural Computation
Improving the performance of a pittsburgh learning classifier system using a default rule
IWLCS'03-05 Proceedings of the 2003-2005 international conference on Learning classifier systems
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
A formal framework for positive and negative detection schemes
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
The representation used by a learning algorithm introduces a bias which is more or less well-suited to any given learning problem. It is well known that, across all possible problems, one algorithm is no better than any other. Accordingly, the traditional approach in machine learning is to choose an appropriate representation making use of some domain-specific knowledge, and this representation is then used exclusively during the learning process.To reduce reliance on domain-knowledge and its appropriate use it would be desirable for the learning algorithm to select its own representation for the problem.We investigate this with XCS, a Michigan-style Learning Classifier System.We begin with an analysis of two representations from the literature: hyperplanes and hyperspheres. We then apply XCS with either one or the other representation to two Boolean functions, the well-known multiplexer function and a function defined by hyperspheres, and confirm that planes are better suited to the multiplexer and spheres to the sphere-based function.Finally, we allow both representations to compete within XCS, which learns the most appropriate representation for problem thanks to the pressure against overlapping rules which its niche GA supplies. The result is an ecology in which the representations are species.