We consider the issues of how a classifier system should learn to represent a Boolean function, and how we should measure its progress in doing so. We identify four properties which may be desirable of a representation; that it be complete, accurate, minimal and non-overlapping. We distinguish two categories of learning metric, introduce new metrics and evaluate them. We demonstrate the superiority of population state metrics over performance metrics in two situations, and in the process find evidence of XCS's strong bias against overlapping rules.
|Translated title of the contribution||What should a classifier system learn and how should we measure it?|
|Pages (from-to)||171 - 182|
|Number of pages||11|
|Journal||Journal of Soft Computing|
|Publication status||Published - Jun 2002|