The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
AN INTRODUCTION TO HIDDEN MARKOV MODELS AND BAYESIAN NETWORKS
Abstract
We provide a tutorial on learning and inference in hidden Markov models in the context of the recent literature on Bayesian networks. This perspective makes it possible to consider novel generalizations of hidden Markov models with multiple hidden state variables, multiscale representations, and mixed discrete and continuous variables. Although exact inference in these generalizations is usually intractable, one can use approximate inference algorithms such as Markov chain sampling and variational methods. We describe how such methods are applied to these generalized hidden Markov models. We conclude this review with a discussion of Bayesian methods for model selection in generalized HMMs.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
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 model for reasoning about persistence and causation
Dean, T., & Kanazawa, K. (1989) · Computational Intelligence · doi:10.1111/j.1467-8640.1989.tb00324.x · Cited by 999
Keeping the neural networks simple by minimizing the description length of the weights
Hinton, G. E., & van Camp, D. (1993) · Proceedings of the sixth annual conference on Computational learning theory - COLT '93 · doi:10.1145/168304.168306 · Cited by 994
Cited by
(2003) · Cited by 1,680
Yu, S.-Z. (2010) · Artificial Intelligence · doi:10.1016/j.artint.2009.11.011 · Cited by 734
Hampton, A. N., Bossaerts, P., & O’Doherty, J. P. (2006) · The Journal of Neuroscience · doi:10.1523/jneurosci.1010-06.2006 · Cited by 498
A probabilistic framework for modeling and real-time monitoring human fatigue
Ji, Q., Lan, P., & Looney, C. (2006) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2005.855922 · Cited by 245
Computational Health Informatics in the Big Data Age: A Survey
Fang, R., Pouyanfar, S., Yang, Y., Chen, S.-C., & Iyengar, S. S. (2017) · ACM Computing Surveys · doi:10.1145/2932707 · Cited by 210
Metadata
- Authors
- GHAHRAMANI, Z.
- Venue
- International Journal of Pattern Recognition and Artificial Intelligence
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 2001-02
- Volume
- 15
- Issue
- 01
- Pages
- 9-42
- ISSN
- 0218-0014 (ISSN-L)
- 1793-6381
- OpenAlex
- W2093135704
- Cited by
- 700
- References
- 4
- FWCI
- 8.26
- 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: AN INTRODUCTION TO HIDDEN MARKOV MODELS AND BAYESIAN NETWORKS. https://app.cochat.ai/papers/10.1142/s0218001401000836
- The paper
- GHAHRAMANI, Z. (2001). AN INTRODUCTION TO HIDDEN MARKOV MODELS AND BAYESIAN NETWORKS. International Journal of Pattern Recognition and Artificial Intelligence. https://doi.org/10.1142/s0218001401000836
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.
