Abstract
Although it is possible to identify building blocks of knowledge created by a learning classifier system in order to reuse them to solve larger scale problems, a scaling limit was still reached in certain domains. Furthermore, it was not possible to transfer functionality from one domain to another. Initial investigations have shown that it is possible and practical to reuse learned rule sets as functions in very simple problems in the same domain. The novel work here seeks to reuse learned knowledge and functionality to scale to complex problems in the same domain and to a related domain for the first time. The past work showed that the reuse of knowledge through the adoption of code fragments, GP-like sub-trees with a depth of at most two, into the XCS learning classifier system framework could provide dividends in scaling; the technique made it possible to solve until then intractable problems like the 135 bit multiplexer. The main contribution of this investigation is that a growing set of learned functions reused in the inner nodes of a code fragment tree can be beneficial. This is anticipated to lead to a reduced search space and increased performance both in terms of instances needed to solve a problem and classification accuracy. We show that through the reuse of learned functionality at the root and leaf nodes of code fragment trees, it is possible to solve complex problems such as the 18 bit hidden multiplexer problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tocci, R.J., Neal, S.: Widmer and Gregory L. Moss: Digital Systems: Principles and Applications. Prentice Hall, Upper Saddle River (2011)
Nisan, N., Schocken, S.: The Elements of Computing Systems: Building a Modern Computer from First Principles. MIT Press, Cambridge (2008)
Alvarez, I.M., Browne, W.N., Zhang, M.: Reusing Learned Functionality in XCS: Code Fragments with Constructed Functionality and Constructed Features. In: Proceedings of the 2014 Conference Companion on Genetic and Evolutionary Computation Companion, pp. 969–976. ACM, Vancouver (2014)
Urbanowicz, R.J., Moore, J.H.: Learning Classifier Systems: A Complete Introduction, Review, and Roadmap. Journal of Artificial Evolution and Applications (2009)
Falkner, N.J.G., Vivian, R.J., Falkner, K.E.: Computer Science Education: The First Threshold Concept. In: LaTiCE, pp. 39–46. IEEE Computer Society (2013)
Iqbal, M., Browne, W.N., Zhang, M.: Evolving Optimum Populations with XCS Classifier Systems. Soft Computing 17, 503–518 (2013)
Koza, J. R.: Digital Systems : Principles and Applications. Prentice Hall, Upper Saddle River (2011)
Koza, J.R.: Hierarchical automatic function definition in genetic programming. In: Foundations of Genetic Algorithms 2, pp. 297–318. Morgan Kaufmann (1992)
Thrun, S.: Is Learning The n-th Thing Any Easier Than Learning The First? In: NIPS, pp. 640–646. MIT Press (1995)
Iqbal, M., Browne, W.N., Zhang, M.: Reusing Building Blocks of Extracted Knowledge to Solve Complex, Large-Scale Boolean Problems. IEEE Transactions on Evolutionary Computation 99, 1–16 (2013)
Iqbal, M., Browne, W.N., Zhang, M.: Learning Overlapping Natured and Niche Imbalance Boolean Problems Using XCS Classifier Systems. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1818–1825 (2013)
Holland, J.: Adaptation. In: Rosen, R., Snell, F. (eds.) Progress in Theoretical Biology. Academic Press (1976)
Iqbal, M., Browne, W.N., Zhang, I.M.: Extending Learning Classifier System with Cyclic Graphs for Scalability on Complex, Large-Scale Boolean Problems. In: GECCO Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, pp. 1045–1052 (2013)
Wilson, S.W.: Classifier Fitness Based on Accuracy. Evolutionary Computation, 149–175 (1995)
Butz, M.V.: Rule-Based Evolutionary Online Learning Systems. Springer, Berlin (2006)
Lanzi, P.L.: Learning Classifier Systems: Then and Now. Evol. Intel. 1, 63–82 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Alvarez, I.M., Browne, W.N., Zhang, M. (2014). Reusing Learned Functionality to Address Complex Boolean Functions. In: Dick, G., et al. Simulated Evolution and Learning. SEAL 2014. Lecture Notes in Computer Science, vol 8886. Springer, Cham. https://doi.org/10.1007/978-3-319-13563-2_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-13563-2_33
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13562-5
Online ISBN: 978-3-319-13563-2
eBook Packages: Computer ScienceComputer Science (R0)