Learning Classifier Systems differ from many other classification techniques, in that new rules are constantly discovered and evaluated. This feature of LCS gives rise to an important problem, how to deal with estimates of rule accuracy that are unreliable due to the small number of performance samples available. In this paper we highlight the importance of this problem for LCS, summarise previous heuristic approaches to the problem, and propose instead the use of principles from Bayesian estimation. In particular we argue that discounting estimates of accuracy based on inexperience must be recognised as a crucially important part of the specification of LCS, and must be well motivated. We present experimental results on using the Bayesian approach to discounting, consider how to estimate the parameters for it, and identify benefits of its use for other areas of LCS.
|Translated title of the contribution||Bayesian Estimation of Rule Accuracy in UCS|
|Title of host publication||Proceedings of the 2007 GECCO Conference Companion on Genetic and Evolutionary Computation|
|Publisher||Association for Computing Machinery (ACM)|
|Publication status||Published - 2007|
Bibliographical noteOther page information: 2831-2834
Conference Proceedings/Title of Journal: Proceedings of the 2007 GECCO Conference Companion on Genetic and Evolutionary Computation
Other identifier: 2000697