{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T04:06:41Z","timestamp":1769918801703,"version":"3.49.0"},"reference-count":1,"publisher":"MIT Press - Journals","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Evolutionary Computation"],"published-print":{"date-parts":[[2003,9]]},"abstract":"<jats:p> Many real-world problems are not conveniently expressed using the ternary representation typically used by Learning Classifier Systems and for such problems an interval-based representation is preferable. We analyse two interval-based representations recently proposed for XCS, together with their associated operators and find evidence of considerable representational and operator bias. We propose a new interval-based representation that is more straightforward than the previous ones and analyse its bias. The representations presented and their analysis are also applicable to other Learning Classifier System architectures. <\/jats:p><jats:p> We discuss limitations of the real multiplexer problem, a benchmark problem used for Learning Classifier Systems that have a continuous-valued representation, and propose a new test problem, the checkerboard problem, that matches many classes of real-world problem more closely than the real multiplexer. <\/jats:p><jats:p> Representations and operators are compared using both the real multiplexer and checkerboard problems and we find that representational, operator and sampling bias all affect the performance of XCS in continuous-valued environments. <\/jats:p>","DOI":"10.1162\/106365603322365315","type":"journal-article","created":{"date-parts":[[2003,9,20]],"date-time":"2003-09-20T08:09:38Z","timestamp":1064045378000},"page":"299-336","source":"Crossref","is-referenced-by-count":115,"title":["For Real! XCS with Continuous-Valued Inputs"],"prefix":"10.1162","volume":"11","author":[{"given":"Christopher","family":"Stone","sequence":"first","affiliation":[{"name":"Faculty of Computing, Engineering and Mathematical Sciences, University of the West of England, Bristol, BS16 1QY, United Kingdom,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry","family":"Bull","sequence":"additional","affiliation":[{"name":"Faculty of Computing, Engineering and Mathematical Sciences, University of the West of England, Bristol BS16 1QY, United Kingdom,"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"281","reference":[{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1995.3.2.149"}],"container-title":["Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/106365603322365315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:30:45Z","timestamp":1615584645000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/evco\/article\/11\/3\/299-336\/1157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":1,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["10.1162\/106365603322365315"],"URL":"https:\/\/doi.org\/10.1162\/106365603322365315","relation":{},"ISSN":["1063-6560","1530-9304"],"issn-type":[{"value":"1063-6560","type":"print"},{"value":"1530-9304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}