An Efficient Algorithm for Estimating State Sequences in Imprecise Hidden Markov Models
From MaRDI portal
Publication:5419480
DOI10.1613/jair.4385zbMath1361.68256arXiv1210.1791OpenAlexW2098349782MaRDI QIDQ5419480
Jasper De Bock, Gert De Cooman
Publication date: 10 June 2014
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.1791
Analysis of algorithms and problem complexity (68Q25) Markov processes: estimation; hidden Markov models (62M05) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (9)
Credal networks under epistemic irrelevance ⋮ Imprecise continuous-time Markov chains ⋮ Desirability foundations of robust rational decision making ⋮ Modelling epistemic irrelevance with choice functions ⋮ Independent natural extension ⋮ Independent natural extension for infinite spaces ⋮ Credal networks under epistemic irrelevance: the sets of desirable gambles approach ⋮ The multilabel naive credal classifier ⋮ Robust queueing theory: an initial study using imprecise probabilities
This page was built for publication: An Efficient Algorithm for Estimating State Sequences in Imprecise Hidden Markov Models