viterbi.msm {msm}R Documentation

Calculate the most likely path through underlying stages

Description

For a fitted hidden Markov model, the Viterbi algorithm recursively constructs the path with the highest probability through the underlying stages.

Usage

viterbi.msm(x)

Arguments

x A fitted hidden Markov multi-state model, as produced by msm

Value

A data frame with columns:
subject = subject identification numbers
time = times of observations
observed = corresponding observed states
fitted = corresponding fitted states found by Viterbi recursion. If the model is not a hidden Markov model, this is just the observed states.

Author(s)

C. H. Jackson chris.jackson@imperial.ac.uk

References

Durbin, R., Eddy, S., Krogh, A. and Mitchison, G. Biological sequence analysis, Cambridge University Press, 1998.

See Also

msm


[Package msm version 0.5.2 Index]