Abstract
Learning Classifier Systems (LCSs) have demonstrated their classification capability by employing a population of polymorphic rules in addressing numerous benchmark problems. However, although the produced solution is often accurate, the alternative ways to represent the data in a single population obscure the underlying patterns of a problem. Moreover, once a population is dominated by over-general rules, the system will sink into the local optimal trap. To grant a problem’s patterns more transparency, the redundant rules and optimal rules need to be distinguished. Therefore, the bagging method is introduced to LCSs with the aim to reduce the variance associated with redundant rules. A novel rule reduction method is proposed to reduce the rules’ polymorphism in a problem. This is tested with complex binary problems with typical epistatic, over-lapping niches, niche-imbalance, and specific-addiction properties at various scales. The results show the successful highlighting of the patterns for all the tested problems, which have been addressed successfully. Moreover, by combining the boosting method with LCSs, the hybrid system could adjust previously defective solutions such that they now represent the correct classification of data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Urbanowicz, R.J., Moore, J.H.: Learning classifier systems: a complete introduction, review, and roadmap. J. Artif. Evol. Appl. 2009, 1 (2009)
Iqbal, M., Naqvi, S.S., Browne, W.N., Hollitt, C., Zhang, M.: Salient object detection using learning classifier systems that compute action mappings. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 525–532. ACM (2014)
Wilson, S.W.: Classifier fitness based on accuracy. Evol. Comput. 3(2), 149–175 (1995)
Urbanowicz, R.J., Moore, J.H.: Exstracs 2.0: description and evaluation of a scalable learning classifier system. Evol. Intel. 8(2–3), 89–116 (2015)
Urbanowicz, R.J., Browne, W.N.: Introduction to Learning Classifier Systems. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-55007-6
Liu, Y., Xue, B., Browne, W.N.: Visualisation and optimisation of learning classifier systems for multiple domain learning. In: Shi, Y., et al. (eds.) SEAL 2017. LNCS, vol. 10593, pp. 448–461. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68759-9_37
Nakata, M., Lanzi, P.L., Takadama, P.: Rule reduction by selection strategy in XCS with adaptive action map. Evol. Intel. 8(2–3), 71–87 (2015)
Dixon, P.W., Corne, D.W., Oates, M.J.: Encouraging compact rulesets from XCS for enhanced data mining. In: Bull, L. (ed.) Applications of Learning Classifier Systems, pp. 92–109. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-39925-4_4
Dixon, P.W., Corne, D.W., Oates, M.J.: A ruleset reduction algorithm for the XCS learning classifier system. In: Lanzi, P.L., Stolzmann, W., Wilson, S.W. (eds.) IWLCS 2002. LNCS (LNAI), vol. 2661, pp. 20–29. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-40029-5_2
Shi, L., Shi, Y., Gao, Y.: Clustering with XCS and agglomerative rule merging. In: Corchado, E., Yin, H. (eds.) IDEAL 2009. LNCS, vol. 5788, pp. 242–250. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04394-9_30
Watkins, C.J.C.H., Dayan, P.: Q-learning. Mach. Learn. 8(3–4), 279–292 (1992)
Breiman, L.: Bagging predictors. Mach. Learn. 24(2), 123–140 (1996)
Freund, Y., Schapire, R.E.: A desicion-theoretic generalization of on-line learning and an application to boosting. In: Vitányi, P. (ed.) EuroCOLT 1995. LNCS, vol. 904, pp. 23–37. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-59119-2_166
Liu, Y., Iqbal, M., Alvarez, I., Browne, W.N.: Integration of code-fragment based learning classifier systems for multiple domain perception and learning. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 2177–2184. IEEE (2016)
Bernadó, E., Llorà, X., Garrell, J.M.: XCS and GALE: a comparative study of two learning classifier systems on data mining. In: Lanzi, P.L., Stolzmann, W., Wilson, S.W. (eds.) IWLCS 2001. LNCS (LNAI), vol. 2321, pp. 115–132. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-48104-4_8
Bull, L., Bernadó-Mansilla, E., Holmes, J.: Learning Classifier Systems in Data Mining, vol. 125. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78979-6
Gathercole, C., Ross, P.: Tackling the boolean even n parity problem with genetic programming and limited-error fitness. Genet. Program. 97, 119–127 (1997)
Iacca, G., Neri, F., Mininno, E., Ong, Y.-S., Lim, M.-H.: Ockham’s Razor in memetic computing: three stage optimal memetic exploration. Inf. Sci. 188, 17–43 (2012)
Iqbal, M., Browne, W.N., Zhang, M.: Learning overlapping natured and niche imbalance boolean problems using XCS classifier systems. In: IEEE Congress on Evolutionary Computation (CEC), pp. 1818–1825 (2013)
Alvarez, I.M., Browne, W.N., Zhang, M.: Reusing learned functionality to address complex boolean functions. In: Dick, G., et al. (eds.) SEAL 2014. LNCS, vol. 8886, pp. 383–394. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-13563-2_33
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Liu, Y., Browne, W.N., Xue, B. (2018). Adapting Bagging and Boosting to Learning Classifier Systems. In: Sim, K., Kaufmann, P. (eds) Applications of Evolutionary Computation. EvoApplications 2018. Lecture Notes in Computer Science(), vol 10784. Springer, Cham. https://doi.org/10.1007/978-3-319-77538-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-77538-8_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-77537-1
Online ISBN: 978-3-319-77538-8
eBook Packages: Computer ScienceComputer Science (R0)