The Bayesian learning classifier system
David Pätzel, Jörg Hähner · Proceedings of the Genetic and Evolutionary Computation Conference · 2022
Learning Classifier Systems (LCSs) are a family of versatile rule-based machine learning algorithms. Despite their long research history, the foundations of most LCSs are still informal due to them having been developed in an ad-hoc manner. An exception to this is the fully Bayesian LCS described by Drugowitsch in his 2008 book. In the present paper we shortly reiterate the central points of that system and then showcase our Python implementation of it, reporting on our attempt at replicating Drugowitsch's empirical results as well as on the results of a preliminary comparison study with the well-known LCS XCSF on the same learning tasks. We are able to replicate parts of Drugowitsch's results and explain the remaining differences. The comparison results make us conclude that the system may be competitive and exhibits unique features. Finally, we identify its current greatest shortcomings and based on those the next steps towards making it more universally usable.