| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] Univ Sao Paulo, Inst Math & Stat, Sao Paulo - Brazil
[2] Ist Dalle Molle Studi Sull Intelligenza Artificia, Manno - Switzerland
[3] Queens Univ Belfast, Knowledge & Data Engn Cluster, Belfast, Antrim - North Ireland
Total Affiliations: 3
|
| Document type: | Journal article |
| Source: | Neurocomputing; v. 180, n. SI, p. 94-107, MAR 5 2016. |
| Web of Science Citations: | 2 |
| Abstract | |
Hidden Markov models (HMMs) are widely used probabilistic models of sequential data. As with other probabilistic models, they require the specification of local conditional probability distributions, whose assessment can be too difficult and error-prone, especially when data are scarce or costly to acquire. The imprecise HMM (iHMM) generalizes HMMs by allowing the quantification to be done by sets of, instead of single, probability distributions. iHMMs have the ability to suspend judgment when there is not enough statistical evidence, and can serve as a sensitivity analysis tool for standard non-stationary HMMs. In this paper, we consider iHMMs under the strong independence interpretation, for which we develop efficient inference algorithms to address standard HMM usage such as the computation of likelihoods and most probable explanations, as well as performing filtering and predictive inference. Experiments with real data show that iHMMs produce more reliable inferences without compromising the computational efficiency. (C) 2015 Elsevier B.V. All rights reserved. (AU) | |
| FAPESP's process: | 13/23197-4 - Efficient algorithms for graph-based decision making under uncertainty |
| Grantee: | Denis Deratani Mauá |
| Support Opportunities: | Scholarships in Brazil - Post-Doctorate |