Classifiers that approximate functions
From MaRDI portal
Publication:698152
DOI10.1023/A:1016535925043zbMATH Open1018.68071OpenAlexW1591645366WikidataQ56442541 ScholiaQ56442541MaRDI QIDQ698152FDOQ698152
Authors: Stewart W. Wilson
Publication date: 18 September 2002
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1016535925043
Recommendations
- A formal framework and extensions for function approximation in learning classifier systems
- Resource management and scalability of the XCSF learning classifier system
- What should a classifier system learn and how should we measure it?
- Approximating arbitrary reinforcement signal by learning classifier systems using micro genetic algorithm
- Fuzzy systems as universal approximators
Cited In (10)
- Approximating arbitrary reinforcement signal by learning classifier systems using micro genetic algorithm
- Resource management and scalability of the XCSF learning classifier system
- Classifier selection from a totally bounded class of functions
- Title not available (Why is that?)
- A formal framework and extensions for function approximation in learning classifier systems
- Forecasting in a complex environment: machine learning sales expectations in a stock flow consistent agent-based simulation model
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online Learning of Single- and Multivalued Functions with an Infinite Mixture of Linear Experts
- Classification by likelihood accordance functions
This page was built for publication: Classifiers that approximate functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698152)