A Probabilistic Distance Measure for Hidden Markov Models
Authors:
- L. R. RabinerLRL. R. Rabiner
- 1 February 1985
- journal article
- website
- Published by Institute of Electrical and Electronics Engineers (IEEE) in AT&T Technical Journal
- Vol. 64 (2) , 391-408
Abstract
We propose a probabilistic distance measure for measuring the dissimilarity between pairs of hidden Markov models with arbitrary observation densities. The measure is based on the Kullback-Leibler number and is consistent with the reestimation techni...Keywords
This publication has 6 references indexed in Scilit:
- Fast quantizing and decoding and algorithms for lattice quantizers and codesIEEE Transactions on Information Theory, 1982
- Rate-distortion speech coding with a minimum discrimination information distortion measureIEEE Transactions on Information Theory, 1981
- An Algorithm for Vector Quantizer DesignIEEE Transactions on Communications, 1980
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov ChainsThe Annals of Mathematical Statistics, 1970
- Probabilistic Functions of Finite State Markov ChainsThe Annals of Mathematical Statistics, 1969
- An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecologyBulletin of the American Mathematical Society, 1967