We consider how state similarity in average reward Markov decision processes (MDPs) may be described by pseudometrics. Introducing the notion of adequate pseudometrics which are we...
Abstract. A hidden Markov model is introduced for descriptive modelling the mosaic–like structures of haplotypes, due to iterated recombinations within a population. Methods usin...
Mikko Koivisto, Teemu Kivioja, Heikki Mannila, Pas...
Seeking to extend the functional capability of the elderly, we explore the use of probabilistic methods to learn and recognise human activity in order to provide monitoring suppor...
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
The goal of Reinforcement learning (RL) is to maximize reward (minimize cost) in a Markov decision process (MDP) without knowing the underlying model a priori. RL algorithms tend ...