The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Hidden Markov models: a guided tour
Abstract
Hidden Markov modeling is a probabilistic technique for the study of time series. Hidden Markov theory permits modeling with any of the classical probability distributions. The costs of implementation are linear in the length of data. Models can be nested to reflect hierarchical sources of knowledge. These and other desirable features have made hidden Markov methods increasingly attractive for problems in language, speech and signal processing. The basic ideas are introduced by elementary examples in the spirit of the Polya urn models. The main tool in hidden Markov modeling is the Baum-Welch (or forward-backward) algorithm for maximum likelihood estimation of the model parameters. This iterative algorithm is discussed both from an intuitive point of view as an exercise in the art of counting and from a formal point of view via the information-theoretic Q-function. Selected examples drawn from the literature illustrate how the Baum-Welch technique places a rich variety of computational models at the disposal of the researcher.>
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
An introduction to hidden Markov models
Rabiner, L., & Juang, B. (1986) · IEEE ASSP Magazine · doi:10.1109/massp.1986.1165342 · Cited by 4,775
A Statistical Model for Positron Emission Tomography
Vardi, Y., Shepp, L. A., & Kaufman, L. (1985) · Journal of the American Statistical Association · doi:10.1080/01621459.1985.10477119 · Cited by 863
Stratonovich, R. L. (1960) · Theory of Probability & Its Applications · doi:10.1137/1105015 · Cited by 339
Explicit modelling of state occupancy in hidden Markov models for automatic speech recognition
Russell, M., & Moore, R. (1985) · ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1985.1168477 · Cited by 194
Cited by
Human motion analysis: a review
Aggarwal, J. K., & Cai, Q. (2002) · Proceedings IEEE Nonrigid and Articulated Motion Workshop · doi:10.1109/namw.1997.609859 · Cited by 1,400
Human Motion Analysis: A Review
Aggarwal, J. K., & Cai, Q. (1999) · Computer Vision and Image Understanding · doi:10.1006/cviu.1998.0744 · Cited by 1,156
Recent developments in human motion analysis
Wang, L., Hu, W., & Tan, T. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(02)00100-0 · Cited by 962
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
McEliece, R. J., MacKay, D. J. C., & Cheng, J.-F. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661103 · Cited by 904
Ephraim, Y., & Merhav, N. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003838 · Cited by 798
Metadata
- Authors
- Poritz, A. B.
- Venue
- ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing
- Publisher
- IEEE
- Published
- 2003-01-06
- Pages
- 7-13
- ISSN
- 1520-6149 (ISSN-L)
- OpenAlex
- W2141899961
- Cited by
- 235
- References
- 5
- FWCI
- 8.59
- Type
- conference paper
- 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: Hidden Markov models: a guided tour. https://app.cochat.ai/papers/10.1109/icassp.1988.196495
- The paper
- Poritz, A. B. (2003). Hidden Markov models: a guided tour. ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing. https://doi.org/10.1109/icassp.1988.196495
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.