Learning Classifier Systems have previously been shown to have some application in deducing the characteristics of complex multi-modal test environments to a suitable level of accuracy. In this study, the issue of presenting human-readable rulesets to a potential user is addressed. In particular, two existing ruleset compaction algorithms originally devised for rulesets with an integer-valued representation are applied to rulesets with a continuous-valued representation. The algorithms are used to reduce the size of rulesets evolved by the XCS classifier system. Following initial testing, both algorithms are modified to take into account problems associated with the new representation. Finally, the modified algorithms are shown to outperform the originals.
展开▼
