Exact Computation of Kullback-Leibler Distance for Hidden Markov Trees and Models

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We suggest new recursive formulas to compute the exact value of the Kullback-Leibler distance (KLD) between two general Hidden Markov Trees (HMTs). For homogeneous HMTs with regular topology, such as homogeneous Hidden Markov Models (HMMs), we obtain a closed-form expression for the KLD when no evidence is given. We generalize our recursive formulas to the case of HMMs conditioned on the observable variables. Our proposed formulas are validated through several numerical examples in which we compare the exact KLD value with Monte Carlo estimations.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Exact Computation of Kullback-Leibler Distance for Hidden Markov Trees and 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 Exact Computation of Kullback-Leibler Distance for Hidden Markov Trees and Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact Computation of Kullback-Leibler Distance for Hidden Markov Trees and Models will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-227767

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.