Bayesian estimation of rule accuracy in UCS

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. Categories and Subject Descriptors G.3 [Mathematics of Computing]: Probability and Statistics General Terms Algori...

• Type: Conference
• Year: 2007
• Where: GECCO
• Authors: James A. R. Marshall, Gavin Brown, Tim Kovacs
• Keywords: Bayesian Estimation, Classifier Systems, GECCO 2007, LCS Gives Rise