Bound on the probability of HMM misclassification
Date
2011ISBN
9781457701252Source
2011 19th Mediterranean Conference on Control and Automation, MED 20112011 19th Mediterranean Conference on Control and Automation, MED 2011
Pages
449454Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
In this paper we consider the problem of classifying a sequence of observations among two known hidden Markov models (HMMs). We use a classifier that minimizes the probability of error (i.e., the probability of misclassification), and we are interested in assessing its performance by computing the a priori probability of error (before any observations are made). This probability (that the classifier makes an incorrect decision) can be obtained, as a function of the length of the sequence of observations, by summing up the probability of misclassification over all possible observation sequences, weighted by their corresponding probabilities. In an effort to avoid the high complexity associated with the computation of the exact probability of error, we establish an upper bound on the probability of error, and we find the necessary and sufficient conditions for this bound to tend to zero exponentially with the number of observation steps. We focus on classification among two HMMs that have the same language, which is the most difficult case to characterize; our approach can easily be applied to classification among any two arbitrary HMMs. The bound we obtain can also be used to approximate the dissimilarity between the two given HMMs. © 2011 IEEE.
Collections
Cite as
Related items
Showing items related by title, author, creator and subject.

Conference Object
Bounds on the probability of misclassification among hidden Markov models
Keroglou, C.; Hadjicostis, Christoforos N. (2011)Given a sequence of observations, classification among two known hidden Markov models (HMMs) can be accomplished with a classifier that minimizes the probability of error (i.e., the probability of misclassification) by ...

Conference Object
Hidden markov model classification based on empirical frequencies of observed symbols
Keroglou, C.; Hadjicostis, Christoforos N. (IFAC Secretariat, 2014)Given a sequence of observations, classification among two known hidden Markov models (HMMs) can be accomplished with a classifier that minimizes the probability of error (i.e., the probability of misclassification) by ...

Article
Performance analysis for a changepoint problem
Hibey, J. L.; Charalambos, C. D. (1999)Nonlinear stochastic differential equations are used to model a version of the changepoint problem. State estimates of the minimum meansquareerrortype are used in likelihoodratio tests to detect the time of change. ...