Szczegóły publikacji
Opis bibliograficzny
Comparison of reinforcement and supervised learning methods in farmer-pest problem with delayed rewards / Bartłomiej ŚNIEŻYŃSKI // W: Computational Collective Intelligence : technologies and applications : 5th international conference, ICCCI 2013 : Craiova, Romania, September 11–13, 2013 : proceedings / eds. Costin Bǎdicǎ, Ngoc Thanh Nguyen, Marius Brezovan. — Berlin ; Heidelberg : Springer-Verlag, cop. 2013. — (Lecture Notes in Artificial Intelligence ; ISSN 0302-9743 ; 8083). — ISBN: 978-3-642-40494-8; e-ISBN: 978-3-642-40495-5. — s. 399–408. — Bibliogr. s. 408, Abstr.
Autor
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 78654 |
|---|---|
| Data dodania do BaDAP | 2013-12-16 |
| DOI | 10.1007/978-3-642-40495-5_40 |
| Rok publikacji | 2013 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | International Conference on Computational Collective Intelligence: Semantic Web, Social Networks and Multiagent Systems 2013 |
| Czasopismo/seria | Lecture Notes in Computer Science |
Abstract
In this paper we propose a method based on the time-window idea which allows agents to generate their strategy using supervised learning algorithms in environments with delayed rewards. It is universal and can be used in various environments. Learning speed of the proposed method and reinforcement learning algorithm are compared in a Farmer-Pest problem with delayed rewards. Farmer-Pest problem is chosen for the comparison because it is designed especially for learning algorithms benchmarking. It has several dimensions which change environment characteristics and allows to test algorithms in various conditions. This paper presents results for one reinforcement learning method (SARSA) and three supervised learning algorithms (Naive Bayes, C4.5 and Ripper). These algorithms are tested on configurations with various complexity.
