A generalized risk-based approach to segmentation based on hidden Markov models

Details A generalized risk-based approach to segmentation based on hidden Markov models A generalized risk-based approach to segmentation based on hidden Markov models

2010-07-21

arxiv.org/abs/1007.3622v1

Statistics

Machine Learning

Submitted to the Journal of Machine Learning Research

Scientific paper

Motivated by the continuing interest in discrete time hidden Markov models (HMMs), this paper reexamines these models using a risk-based approach. Simple modifications of the classical optimization criteria for hidden path inference lead to a new class of hidden path estimators. The estimators are efficiently computed in the usual forward-backward manner and a corresponding dynamic programming algorithm is also presented. A particularly interesting subclass of such alignments are sandwiched between the most common {\em maximum a posteriori} (MAP), or Viterbi, path estimator and the minimum error, or {\em pointwise maximum a posteriori} (PMAP), estimator. Similar to previous work, the new class is parameterized by a small number of tunable parameters. Unlike their previously proposed relatives, the new parameters and class are more explicit and have clear interpretations, and bypass the issue of numerical scaling, which can be particularly valuable for applications.

Affiliated with

Also associated with

No associations

Rating

A generalized risk-based approach to segmentation based on hidden Markov models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A generalized risk-based approach to segmentation based on hidden Markov models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A generalized risk-based approach to segmentation based on hidden Markov models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183713