A4 Vertaisarvioitu artikkeli konferenssijulkaisussa
Regularized Least-Squares for Learning Non-Transitive Preferences between Strategies
Tekijät: Pahikkala T, Tsivtsivadze E, Airola A, Salakoski T
Toimittaja: Raiko T, Haikonen P, Väyrynen J
Konferenssin vakiintunut nimi: 13th Finnish Artificial Intelligence Conference
Kustantaja: Finnish Artificial Intelligence Society
Julkaisuvuosi: 2008
Journal: Publications of the Finnish Artificial Intelligence Society
Kokoomateoksen nimi: Proceedings of the 13th Finnish Artificial Intelligence Conference and Nokia Workshop on Machine Consciousness
Sarjan nimi: Publications of the Finnish Artificial Intelligence Society
Vuosikerta: 24
ISBN: 978-952-5677-04-1
eISBN: 978-952-5677-05-8
ISSN: 1238-4658
Most of the current research in preference learning has concentrated on learning transitive relations. However, there are many interesting problems that are non-transitive. Such a learning task is, for example, the prediction of the probable winner given the strategies of two competitors. In this paper, we investigate whether there is a need to learn non-transitive preferences, and whether they can be learned efficiently. In particular, we consider cyclic preferences such as those observed in the game of rock paper and scissors.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
