ACM Home Page
Please provide us with feedback. Feedback
Modeling UCS as a mixture of experts
Full text PdfPdf (459 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
SESSION: Track 11: genetics-based machine learning table of contents
Pages 1187-1194  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Narayanan Unny Edakunni  University of Bristol, Bristol, United Kingdom
Tim Kovacs  University of Bristol, Bristol, United Kingdom
Gavin Brown  University of Manchester, Manchester, United Kingdom
James A.R. Marshall  University of Bristol, Bristol, United Kingdom
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 19,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1570061
What is a DOI?

ABSTRACT

We present a probabilistic formulation of UCS (a sUpervised Classifier System). UCS is shown to be a special case of mixture of experts where the experts are learned independently and later combined during prediction. In this work, we develop the links between the constituent components of UCS and a mixture of experts, thus lending UCS a strong analytical background. We find during our analysis that mixture of experts is a more generic formulation of UCS and possesses more generalization capability and flexibility than UCS, which is also verified using empirical evaluations. This is the first time that a simple probabilistic model has been proposed for UCS and we believe that this work will form a useful tool to analyse Learning Classifier Systems and gain useful insights into their working.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Arthur Dempster, Nan Laird, and Donald Rubin. Likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39(1):1--38, 1977.
 
4
 
5
Narayanan U. Edakunni and Tim Kovacs. Probabilistic modeling of UCS : a theoretical study. Technical report, University of Bristol, 2009.
 
6
 
7
Tim Kovacs. Genetics-based machine learning. In Grzegorz Rozenberg, Thomas Back, and Joost Kok, editors, Handbook of Natural Computing: Theory, Experiments, and Applications. Springer Verlag, 2009.
8

Collaborative Colleagues:
Narayanan Unny Edakunni: colleagues
Tim Kovacs: colleagues
Gavin Brown: colleagues
James A.R. Marshall: colleagues