A solution for the learning problem in evidential (partially) hidden Markov models based on conditional belief functions and EM
DOI10.1007/978-3-319-40596-4_26zbMATH Open1452.68156OpenAlexW2490079206MaRDI QIDQ5115737FDOQ5115737
Publication date: 18 August 2020
Published in: Information Processing and Management of Uncertainty in Knowledge-Based Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-40596-4_26
Recommendations
Markov chainparameter learningbelief functionsevidential latent variableevidential temporal graphical model
Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
- Learning from partially supervised data using mixture models and belief functions
- Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem
- Multisensor triplet Markov chains and theory of evidence
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Forward-Backward-Viterbi Procedures in the Transferable Belief Model for State Sequence Analysis Using Belief Functions
Cited In (1)
Uses Software
This page was built for publication: A solution for the learning problem in evidential (partially) hidden Markov models based on conditional belief functions and EM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115737)