Acceleration of association‐rule based markov decision processes

In this paper, we present a new approach for the estimation of Markov decision processes based on efficient association rule mining techniques such as Apriori. For the fastest solution of the resulting association‐rule based Markov decision process, several accelerating procedures such as asynchrono...

Full description

Saved in:
Bibliographic Details
Published inJournal of applied research and technology Vol. 7; no. 3
Main Authors Garcí­a-Hernández, Ma. de G., Ruiz-Pinales, J., Reyes-Ballesteros, A., Onaindí­a, E., Gabriel Aviña-Cervantes, J., Ledesma, S.
Format Journal Article
LanguageEnglish
Published 01.12.2009
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present a new approach for the estimation of Markov decision processes based on efficient association rule mining techniques such as Apriori. For the fastest solution of the resulting association‐rule based Markov decision process, several accelerating procedures such as asynchronous updates and prioritization using a static ordering have been applied. A new criterion for state reordering in decreasing order of maximum reward is also compared with a modified topological reordering algorithm. Experimental results obtained on a finite state and action‐space stochastic shortest path problem demonstrate the feasibility of the new approach.
ISSN:1665-6423
2448-6736
DOI:10.22201/icat.16656423.2009.7.03.493