The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
A Probabilistic Distance Measure for Hidden Markov Models
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 technique for hidden Markov models. Numerical examples that demonstrate the utility of the proposed distance measure are given for hidden Markov models with discrete densities. We also discuss the effects of various parameter deviations in the Markov models on the resulting distance, and study the relationships among parameter estimates (obtained from reestimation), initial guesses of parameter values, and observation duration through the use of the measure.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
Information theory and statistics
(1959) · Journal of the Franklin Institute · doi:10.1016/0016-0032(59)90368-0 · Cited by 7,094
Baum, L. E., Petrie, T., Soules, G., & Weiss, N. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697196 · Cited by 4,297
Baum, L. E., & Eagon, J. A. (1967) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1967-11751-8 · Cited by 1,036
Levinson, S. E., Rabiner, L. R., & Sondhi, M. M. (1983) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1983.tb03114.x · Cited by 978
Self-citationErgodic Theory and Information
Révész, P., Billingsley, P., & Revesz, P. (1966) · Revue de l'Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1401263 · Cited by 864
Fast quantizing and decoding and algorithms for lattice quantizers and codes
Conway, J., & Sloane, N. J. A. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056484 · Cited by 439
Probabilistic Functions of Finite State Markov Chains
Petrie, T. (1969) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697807 · Cited by 158
Rate-distortion speech coding with a minimum discrimination information distortion measure
Gray, R. M., Gray, A., Rebolledo, G., & Shore, J. E. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056410 · Cited by 98
Cited by
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Self-citationMixture autoregressive hidden Markov models for speech signals
Juang, B.-H., & Rabiner, L. (1985) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1985.1164727 · Cited by 305
Self-citationA frequency warping approach to speaker normalization
Lee, L., & Rose, R. (1998) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/89.650310 · Cited by 294
Metadata
- Authors
- Juang, B.-H., & Rabiner, L. R.
- Venue
- AT&T Technical Journal
- Published
- 1985-02
- Volume
- 64
- Issue
- 2
- Pages
- 391-408
- ISSN
- 2376-676X (ISSN-L)
- 8756-2324
- OpenAlex
- W2075978670
- Cited by
- 375
- References
- 9
- FWCI
- 2.98
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Probabilistic Distance Measure for Hidden Markov Models. https://app.cochat.ai/papers/10.1002/j.1538-7305.1985.tb00439.x
- The paper
- Juang, B.-H., & Rabiner, L. R. (1985). A Probabilistic Distance Measure for Hidden Markov Models. AT&T Technical Journal. https://doi.org/10.1002/j.1538-7305.1985.tb00439.x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.