Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1068009.1068319acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
Article

Extending XCSF beyond linear approximation

Published: 25 June 2005 Publication History

Abstract

XCSF is the extension of XCS in which classifier prediction is computed as a linear combination of classifier inputs and a weight vector associated to each classifier. XCSF can exploit classifiers' computable prediction to evolve accurate piecewise linear approximations of functions. In this paper, we take XCSF one step further and show how XCSF can be easily extended to allow polynomial approximations. We test the extended version of XCSF on various approximation problems and show that quadratic/cubic approximations can be used to significantly improve XCSF's generalization capabilities.

References

[1]
J. A. Boyan. Least-squares temporal difference learning. In Proc. 16th International Conf. on Machine Learning, pages 49--56. Morgan Kaufmann, San Francisco, CA, 1999.]]
[2]
S. J. Bradtke and A. G. Barto. Linear least-squares algorithms for temporal difference learning. Machine Learning, 22(1-3):33--57, 1996.]]
[3]
M. V. Butz and S. W. Wilson. An algorithmic description of XCS. Journal of Soft Computing, 6(3--4):144--153, 2002.]]
[4]
M. Galassi, J. Davies, J. Theiler, B. Gough, G. Jungman, M. Booth, and F. Rossi. GNU Scientific Library Reference Manual -- Second Edition. Network Theory Ltd., 2003. (paperback).]]
[5]
S. A. Glantz and B. K. Slinker. Primer of Applied Regression & Analysis of Variance. McGraw Hill, 2001. second edition.]]
[6]
S. Haykin. Adaptive Filter Theory. Prentice-Hall, 1986.]]
[7]
S. Haykin. Neural Networks: A Comprehensive Foundation. Prentice Hall PTR, 1998.]]
[8]
J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.]]
[9]
J. R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge Massachusetts, May 1994.]]
[10]
P. L. Lanzi, D. Loiacono, S. W. Wilson, and D. E. Goldberg. Generalization in the XCSF classifier system: Analysis, improvement, and extension. Technical Report 2005012, Illinois Genetic Algorithms Laboratory -- University of Illinois at Urbana-Champaign, 2005.]]
[11]
W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, editors. Numerical Recipes in C++: The Art of Scientific Computing. Cambridge University Press, Feb. 2002.]]
[12]
B. Widrow and M. E. Hoff. Adaptive Switching Circuits, chapter Neurocomputing: Foundation of Research, pages 126--134. The MIT Press, Cambridge, 1988.]]
[13]
S. W. Wilson. Classifier Fitness Based on Accuracy. Evolutionary Computation, 3(2):149--175, 1995. http://prediction-dynamics.com/.]]
[14]
S. W. Wilson. Mining Oblique Data with XCS. In P. L. Lanzi, W. Stolzmann, and S. W. Wilson, editors, Advances in Learning Classifier Systems. Third International Workshop, IWLCS 2000, Paris, France, September 15-16, volume 1996 of Lecture notes in Computer Science, pages 158--174. Springer-Verlag, Apr. 2001.]]
[15]
S. W. Wilson. Classifiers that approximate functions. Journal of Natural Computating, 1(2-3):211--234, 2002.]]
[16]
I. Zelinka. Analytic programming by means of soma algorithm. In Proceedings of the 8th International Conference on Soft Computing, Mendel'02, pages 93--101, Brno,Czech Republic, 2002.]]

Cited By

View all
  • (2024)XCS: Is Covering All You Need?Proceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3638530.3664146(1788-1796)Online publication date: 14-Jul-2024
  • (2023)Evolutionary Regression and ModellingHandbook of Evolutionary Machine Learning10.1007/978-981-99-3814-8_5(121-149)Online publication date: 2-Nov-2023
  • (2022)Deep Reinforcement Learning with a Classifier System – First StepsArchitecture of Computing Systems10.1007/978-3-031-21867-5_17(256-270)Online publication date: 14-Dec-2022
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computation
June 2005
2272 pages
ISBN:1595930108
DOI:10.1145/1068009
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 June 2005

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. LCS
  2. XCS
  3. function approximation
  4. least squares

Qualifiers

  • Article

Conference

GECCO05
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)XCS: Is Covering All You Need?Proceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3638530.3664146(1788-1796)Online publication date: 14-Jul-2024
  • (2023)Evolutionary Regression and ModellingHandbook of Evolutionary Machine Learning10.1007/978-981-99-3814-8_5(121-149)Online publication date: 2-Nov-2023
  • (2022)Deep Reinforcement Learning with a Classifier System – First StepsArchitecture of Computing Systems10.1007/978-3-031-21867-5_17(256-270)Online publication date: 14-Dec-2022
  • (2020)An adaption mechanism for the error threshold of XCSFProceedings of the 2020 Genetic and Evolutionary Computation Conference Companion10.1145/3377929.3398106(1756-1764)Online publication date: 8-Jul-2020
  • (2020)Optimality-Based Analysis of XCSF Compaction in Discrete Reinforcement LearningParallel Problem Solving from Nature – PPSN XVI10.1007/978-3-030-58115-2_33(471-484)Online publication date: 2-Sep-2020
  • (2019)Learning classifier systemsProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3319619.3323393(747-769)Online publication date: 13-Jul-2019
  • (2018)What about interpolation?Proceedings of the Genetic and Evolutionary Computation Conference10.1145/3205455.3205599(537-544)Online publication date: 2-Jul-2018
  • (2017)Exemplar-Based Learning Classifier System with Dynamic Matching Range for Imbalanced DataJournal of Advanced Computational Intelligence and Intelligent Informatics10.20965/jaciii.2017.p086821:5(868-875)Online publication date: 20-Sep-2017
  • (2015)An Improved Continuous-Action Extended Classifier Systems for Function ApproximationProcedia Computer Science10.1016/j.procs.2015.09.16061(361-366)Online publication date: 2015
  • (2015)XCSF with tile coding in discontinuous action-value landscapesEvolutionary Intelligence10.1007/s12065-015-0129-78:2-3(117-132)Online publication date: 11-Apr-2015
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media