The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
The Infinite Hidden Markov Model
Abstract
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integrate out the infinitely many transition parameters, leaving only three hyperparameters which can be learned from data. These three hyperparameters define a hierarchical Dirichlet process capable of capturing a rich set of transition dynamics. The three hyperparameters control the time scale of the dynamics, the sparsity of the underlying state-transition matrix, and the expected number of distinct hidden states in a finite sequence. In this framework it is also natural to allow the alphabet of emitted symbols to be infinite---consider, for example, symbols being possible words appearing in English text.
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 introduction to hidden Markov models
Rabiner, L., & Juang, B. (1986) · IEEE ASSP Magazine · doi:10.1109/massp.1986.1165342 · Cited by 4,775
A Bayesian Analysis of Some Nonparametric Problems
Ferguson, T. S. (1973) · The Annals of Statistics · doi:10.1214/aos/1176342360 · Cited by 4,697
Markov Chain Sampling Methods for Dirichlet Process Mixture Models
Neal, R. M. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474879 · Cited by 2,288
Mixtures of Dirichlet Processes with Applications to Bayesian Nonparametric Problems
Antoniak, C. E. (1974) · The Annals of Statistics · doi:10.1214/aos/1176342871 · Cited by 1,972
The Infinite Gaussian Mixture Model
Rasmussen, C. E. (1999) · Cited by 1,057
Self-citationA hierarchical Dirichlet language model
MacKay, D. J. C., & Peto, L. C. B. (1995) · Natural Language Engineering · doi:10.1017/s1351324900000218 · Cited by 274
Hidden Markov Model Induction by Bayesian Model Merging
Stolcke, A., & Omohundro, S. M. (1992) · Cited by 236
Cited by
Hierarchical Dirichlet Processes
Teh, Y. W., Jordan, M. I., Beal, M. J., & Blei, D. M. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000302 · Cited by 2,120
Self-citation(2003) · Cited by 1,680
Yu, B. M., Cunningham, J. P., Santhanam, G., Ryu, S. I., Shenoy, K. V., & Sahani, M. (2009) · Journal of Neurophysiology · doi:10.1152/jn.90941.2008 · Cited by 656
A tutorial on Bayesian nonparametric models
Gershman, S. J., & Blei, D. M. (2012) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2011.08.004 · Cited by 605
Church: a language for generative models
Goodman, N., Mansinghka, V., Roy, D. M., Bonawitz, K., & Tenenbaum, J. B. (2012) · arXiv · doi:10.48550/arxiv.1206.3255 · Cited by 577
Metadata
- Authors
- Beal, M. J., Ghahramani, Z., & Rasmussen, C. E.
- Venue
- Advances in Neural Information Processing Systems 14
- Publisher
- The MIT Press
- Published
- 2002-11-08
- Pages
- 577-584
- OpenAlex
- W2158190429
- Cited by
- 481
- References
- 7
- FWCI
- 7.69
- Type
- book chapter
- 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: The Infinite Hidden Markov Model. https://app.cochat.ai/papers/10.7551/mitpress/1120.003.0079
- The paper
- Beal, M. J., Ghahramani, Z., & Rasmussen, C. E. (2002). The Infinite Hidden Markov Model. Advances in Neural Information Processing Systems 14. https://doi.org/10.7551/mitpress/1120.003.0079
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.