arrow
返回

Function approximation with XCS: Hyperellipsoidal conditions, recursive least squares, and compaction

delete2008-06-01
delete79
PRE
AI
M
Martin V. Butz *
P
Pier Luca Lanzi
S
Stewart W. Wilson
DOI:10.1109/TEVC.2007.903551delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
An important strength of learning classifier systems (LCSs) lies in the combination of genetic optimization techniques with gradient-based approximation techniques. The chosen approximation technique develops locally optimal approximations, such as accurate classification estimates, Q-value predictions, or linear function approximations. The genetic optimization technique is designed to distribute these local approximations efficiently over the problem space. Together, the two components develop a distributed, locally optimized problem solution in the form of a population of expert rules, often called classifiers. In function approximation problems, the XCSF classifier system develops a problem solution in the form of overlapping, piecewise linear approximations. This paper shows that XCSF performance on function approximation problems additively benefits from: 1) improved representations; 2) improved genetic operators; and 3) improved approximation techniques. Additionally, this paper introduces a novel closest classifier matching mechanism for the efficient compaction of XCS's final problem solution. The resulting compaction mechanism can boil the population size down by 90% on average, while decreasing prediction accuracy only marginally. Performance evaluations show that the additional mechanisms enable XCSF to reliably, accurately, and compactly approximate even seven dimensional functions. Performance comparisons with other, heuristic function approximation techniques show that XCSF yields competitive or even superior noise-robust performance.
Keyword:
closest classifier matching (CCM)
compaction
condensation
function approximation
genetic algorithm (GA)
hyperellipsoids
learning classifier system (LCS)
neural network (NN)
recursive least squares (RLS)
self organization
XCS

期刊

IEEE Transactions on Evolutionary Computation 封面图
IEEE Transactions on Evolutionary Computation
IF:
12
论文数:
1.8K
被引数:
2.4W

机构

P
Polytechnic University of Milan
学者数:
2.0W
论文数: 1.8W
被引数: 24
U
University of Wurzburg
学者数:
2.5W
论文数: 2.0W
被引数: 2.5W
引用论文

引用论文

A rapid and efficient SDS-based RNA isolation protocol from different tissues of coffee
err2018-03-14
err0
errOAAI
errArun Kumar C. Huded; Pavankumar Jingade; Manoj Kumar Mishra
err分享
err收藏
A study on the status of fluoride ion in groundwater of coastal hard rock aquifers of south India
err2012-09-08
err0
PREAI
errC. Singaraja; S. Chidambaram; P. Anandhan; M. V. Prasanna; C. Thivya; R. Thilagavathi
err分享
err收藏
Locally weighted learning
err1997-01-01
err1.2K
PREAI
errAtkeson, CG; Moore, AW; Schaal, S
err分享
err收藏
Non-invasive characterization of the pigment’s palette used on the painted tomb slabs at Paestum archaeological site
err2020-11-01
err0
errOAAI
errM. F. Alberghina; C. Germinario; G. Bartolozzi; S. Bracci; C. Grifa; F. Izzo; M.F. La Russa; D. Magrini; E. Massa; M. Mercurio; V. Mollica Nardo; M.E. Oddo; S. M. Pagnotta; A. Pelagotti; R. C. Ponterio; P. Ricci; N. Rovella; S. A. Ruffolo; S. Schiavone; A. Spagnuolo; C. Vetromile; G. Zuchtriegel; C. Lubritto
err分享
err收藏
学者 查看更多内容