markov-chains-2

# markov-chains-2 - Markov Chain Models (Part 2) BMI/CS 576

This preview shows pages 1–3. Sign up to view the full content.

Markov Chain Models (Part 2) BMI/CS 576 www.biostat.wisc.edu/bmi576/ Mark Craven craven@biostat.wisc.edu Fall 2011 Higher order Markov chains the Markov property specifies that the probability of a state depends only on the probability of the previous state but we can build more “memory” into our states by using a higher order Markov model in an n th order Markov model P ( x i | x i " 1 , x i " 2 ,..., x 1 ) = P ( x i | x i " 1 ,..., x i " n )

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Selecting the order of a Markov chain model higher order models remember more “history” additional history can have predictive value example: – predict the next word in this sentence fragment “… the__” ( duck , end , grain , tide , wall , …?) Selecting the order of a Markov chain model but the number of parameters we need to estimate grows exponentially with the order – for modeling DNA we need parameters for an n th order model the higher the order, the less reliable we can expect our parameter estimates to be
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 12/15/2011 for the course BMI 576 taught by Professor Staff during the Fall '11 term at Wisc Green Bay.

### Page1 / 7

markov-chains-2 - Markov Chain Models (Part 2) BMI/CS 576

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online