Making Use of Partial Knowledge About Hidden States in HMMs: An Approach Based on Belief Functions
IEEE Transactions on Fuzzy SystemsPublished 24 April 2013Open access
Emmanuel Ramasso, Thierry Denœux
Citations69
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Experimental results demonstrate that partial information about hidden states, when available, may substantially improve the estimation and prediction performances.
Abstract
International audience
Keywords
Computer Science
Journal of the Royal Statistical Society Series B (Statistical Methodology)Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm
49,657 Citations1977A. P. Dempster, N. M. Laird +1 more
Proceedings of the IEEEA tutorial on hidden Markov models and selected applications in speech recognition
22,785 Citations1989L. R. Rabiner
Journal of Electronic ImagingPattern Recognition and Machine Learning
21,976 Citations2007Christopher Bishop
Probability Distributions, linear models for Regression, Linear Models for Classification, Neural Networks, Graphical Models, Mixture Models and EM, Sampling Methods, Continuous Latent Variables, Sequential Data are studied.
Journal of ClassificationComparing partitions
7,714 Citations1985Lawrence J. Hubert, Phipps Arabie
A measure based on the comparison of object triples having the advantage of a probabilistic interpretation in addition to being corrected for chance is proposed and bounded between ±1.5 and ±2.5.
IEEE Transactions on Information TheoryError bounds for convolutional codes and an asymptotically optimum decoding algorithm
6,705 Citations1967Andrew J. Viterbi
The upper bound is obtained for a specific probabilistic nonsequential decoding algorithm which is shown to be asymptotically optimum for rates above R_{0} and whose performance bears certain similarities to that of sequential decoding algorithms.
Proceedings of the IEEEThe viterbi algorithm
5,595 Citations1973G. David Forney
This paper gives a tutorial exposition of the Viterbi algorithm and of how it is implemented and analyzed, and increasing use of the algorithm in a widening variety of areas is foreseen.
Digital Access to Scholarship at Harvard (DASH) (Harvard University)Maximum Likelihood from Incomplete Data via the EM Algorithm
4,523 Citations1977Dempster, Arthur P., Laird, Nan M. +1 more
Dynamic bayesian networks: representation, inference and learning
2,597 Citations2002Kevin P. Murphy, Stuart Russell
This thesis will discuss how to represent many different kinds of models as DBNs, how to perform exact and approximate inference in Dbns, and how to learn DBN models from sequential data.
Damage propagation modeling for aircraft engine run-to-failure simulation
1,620 Citations2008Abhinav Saxena, Kai Goebel +2 more
Mechanical Systems and Signal ProcessingA segmental hidden semi-Markov model (HSMM)-based diagnostics and prognostics framework and methodology
307 Citations2006Ming Dong, David He
A statistical modelling methodology for performing both diagnosis and prognosis in a unified framework based on segmental hidden semi-Markov models (HSMMs), which can be used to predict the useful remaining life of a system.
IEEE Transactions on Knowledge and Data EngineeringMaximum Likelihood Estimation from Uncertain Data in the Belief Function Framework
246 Citations2011Thierry Denœux
This work proposes a variant of the EM algorithm that iteratively maximizes the maximization of a generalized likelihood criterion, which can be interpreted as a degree of agreement between the statistical model and the uncertain observations.
IEEE Transactions on Pattern Analysis and Machine IntelligencePairwise markov chains
133 Citations2003Wojciech Pieczynski
An original method of parameter estimation, which generalizes the classical iterative conditional estimation (ICE) valid for a classical hidden Markov chain model, and whose extension to possibly non-Gaussian and correlated noise is briefly treated.
Fuzzy Sets and SystemsMaximum likelihood estimation from fuzzy data using the EM algorithm
127 Citations2011Thierry Denœux
It is shown that the EM algorithm may be used for estimating the parameters in a parametric statistical model when the observations are fuzzy and are assumed to be related to underlying crisp realizations of a random sample.
Pattern RecognitionLearning from partially supervised data using mixture models and belief functions
123 Citations2008Étienne Côme, Latifa Oukhellou +2 more
Using the generalized Bayesian theorem, an extension of Bayes' theorem in the belief function framework, a criterion generalizing the likelihood function is derived, allowing the ability of this approach to exploit partial information about class labels.
IEEE Transactions on Geoscience and Remote SensingMultisensor image segmentation using Dempster-Shafer fusion in Markov fields context
98 Citations2001A. Bendjebbour, Yves Delignon +3 more
An original variant of generalized mixture estimation, making possible the unsupervised evidential fusion in a Markovian context, is described and is applied to the unsupervised segmentation of real radar and SPOT images showing the relevance of the proposed models and corresponding segmentation methods in real situations.
OhioLink ETD Center (Ohio Library and Information Network)Trajectory Similarity Based Prediction for Remaining Useful Life Estimation
96 Citations2010Tianyi Wang
A novel RUL prediction method inspired by the Instance Based Learning methodology, called Trajectory Similarity Based Prediction (TSBP), is proposed, which uses the historical instances of a system with life-time condition data and known failure time to create a library of degradation models.
IEEE Transactions on CyberneticsJoint Prediction of Continuous and Discrete States in Time-Series Based on Belief Functions
95 Citations2012Emmanuel Ramasso, Michèle Rombaut +1 more
This paper proposes an approach based on case-based reasoning that jointly estimates the future values of the continuous signal and the future discrete modes and relies on the K-nearest neighbor algorithm based on belief function theory.
International Journal of Approximate ReasoningMultisensor triplet Markov chains and theory of evidence
77 Citations2006Wojciech Pieczynski
Different possibilities of using the Dempster-Shafer fusion in the context of different multisensor Markov models are presented and it is shown that the posterior distribution remains calculable in different general situations.
International Journal of Pattern Recognition and Artificial IntelligenceHIDDEN MARKOV MODELS FOR MODELING AND RECOGNIZING GESTURE UNDER VARIATION
60 Citations2001Andrew D. Wilson, Aaron Bobick
Two frameworks based on hidden Markov models are presented, designed to model and recognize gestures that vary in systematic ways, and variation in the signal is overcome by relying on online learning rather than conventional offline, batch learning.
IEEE Transactions on Fuzzy SystemsFuzzy Time Series Forecasting With a Probabilistic Smoothing Hidden Markov Model
59 Citations2011Yi‐Chung Cheng, Sheng-Tun Li
This paper proposes an enhanced HMM-based forecasting model by developing a novel fuzzy smoothing method to overcome performance deterioration, and the roulette-wheel selection approach is applied to probabilistically determine the forecasting result.
IEEE Transactions on Signal ProcessingUnsupervised restoration of hidden nonstationary Markov chains using evidential priors
55 Citations2005Pierre Lanchantin, Wojciech Pieczynski
This paper shows, via simulations, that the classical restoration results can be improved by the use of the theory of evidence and Dempster-Shafer fusion, and is performed in an entirely unsupervised way using an original parameter estimation method.
Soft ComputingPartially supervised Independent Factor Analysis using soft labels elicited from multiple experts: application to railway track circuit diagnosis
32 Citations2011Zohra Cherfi, Latifa Oukhellou +3 more
Fusing partially reliable information about cluster membership is shown to significantly improve classification results and to handle this learning process in a soft-supervised way using imperfect information on the system component states.
IEEE Transactions on Circuits and Systems for Video TechnologyState Filtering and Change Detection Using TBM Conflict Application to Human Action Recognition in Athletics Videos
24 Citations2007Emmanuel Ramasso, Michèle Rombaut +1 more
A tool called temporal credal filter with conflict-based model change (TCF-CMC) to smooth belief functions online in transferable belief model (TBM) framework and is compared to hidden Markov models.
Time-Sliced Temporal Evidential Networks: The case of Evidential HMM with application to dynamical system analysis
18 Citations2011Lisa Serir, Emmanuel Ramasso +1 more
This paper proposes to complete the generalization of HMM to belief functions with a method for automatic parameter training and proposes to use the theory of belief functions as described by Dempster, Shafer and Smets to solve this problem.
Studies in fuzziness and soft computingOn Evidential Markov Chains
14 Citations2010Hélène Soubaras
New theoretical aspects about the conditioning of belief functions and the comparison to classical Markov chains and HMMs will be discussed and new computation tools based on matrices are proposed.