The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Factorial Hidden Markov Models.
Open accessAbstract
. Hidden Markov models (HMMs) have proven to be one of the most widely used tools for learning probabilistic models of time series data. In an HMM, information about the past is conveyed through a single discrete variable---the hidden state. We discuss a generalization of HMMs in which this state is factored into multiple state variables and is therefore represented in a distributed manner. We describe an exact algorithm for inferring the posterior probabilities of the hidden state variables given the observations, and relate it to the forward--backward algorithm for HMMs and to algorithms for more general graphical models. Due to the combinatorial nature of the hidden state representation, this exact algorithm is intractable. As in other intractable systems, approximate inference can be carried out using Gibbs sampling or variational methods. Within the variational framework, we present a structured approximation in which the the state variables are decoupled, yielding a tractable alg...
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
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
McCullagh, P., & Nelder, J. A. (1989) · doi:10.1007/978-1-4899-3242-6 · Cited by 16,836
(1988) · Cited by 16,582
An introduction to hidden Markov models
Rabiner, L., & Juang, B. (1986) · IEEE ASSP Magazine · doi:10.1109/massp.1986.1165342 · Cited by 4,775
Baum, L. E., Petrie, T., Soules, G., & Weiss, N. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697196 · Cited by 4,297
Lauritzen, S. L., & Spiegelhalter, D. J. (1988) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1988.tb01721.x · Cited by 3,902
Neural Networks and the Bias/Variance Dilemma
Geman, S., Bienenstock, E., & Doursat, R. (1992) · Neural Computation · doi:10.1162/neco.1992.4.1.1 · Cited by 3,578
Elements of Information Theory
Jacobs, K. (1992) · Discrete Stochastics · doi:10.1007/978-3-0348-8645-1_7 · Cited by 2,918
Hierarchical Mixtures of Experts and the EM Algorithm
Jordan, M. I., & Jacobs, R. A. (1994) · Neural Computation · doi:10.1162/neco.1994.6.2.181 · Cited by 2,673
Self-citationUCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
(1993) · Cited by 1,173
Probabilistic Inference Using Markov Chain Monte Carlo Methods
Neal, R. M. (2011) · Cited by 1,040
Learning and relearning in Boltzmann machines
Hinton, G. E., & Sejnowski, T. J. (2001) · Graphical Models · doi:10.7551/mitpress/3349.003.0005 · Cited by 1,037
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
Connectionist learning of belief networks
Neal, R. M. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90065-6 · Cited by 513
Bishop, R. F. (1989) · Contemporary Physics · doi:10.1080/00107518908225513 · Cited by 447
Mean Field Theory for Sigmoid Belief Networks
Saul, L. K., Jaakkola, T., & Jordan, M. I. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.251 · Cited by 327
Self-citationMultiple viewpoint systems for music prediction
Conklin, D., & Witten, I. H. (1995) · Journal of New Music Research · doi:10.1080/09298219508570672 · Cited by 327
An Input Output HMM Architecture
Bengio, Y., & Frasconi, P. (1994) · Cited by 267
Applications of a general propagation algorithm for probabilistic expert systems
Dawid, A. P. (1992) · Statistics and Computing · doi:10.1007/bf01890546 · Cited by 239
Hidden Markov Model Induction by Bayesian Model Merging
Stolcke, A., & Omohundro, S. M. (1992) · Cited by 236
Stochastic Simulation Algorithms for Dynamic Probabilistic Networks
Kanazawa, K., Koller, D., & Russell, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4965 · Cited by 219
Exploiting Tractable Substructures in Intractable Networks
Saul, L. K., & Jordan, M. I. (1995) · Cited by 203
Self-citationA new view of the EM algorithm that justifies incremental and other variants
Neal, R. M. (1993) · Cited by 160
A minimum description length framework for unsupervised learning
Zemel, R. S. (1994) · Cited by 95
Jordan, M. I., Ghahramani, Z., & Saul, L. K. (1996) · Cambridge University Engineering Department Publications Database · Cited by 89
Self-citationBoltzmann Chains and Hidden Markov Models
Saul, L. K., & Jordan, M. I. (1994) · Cited by 68
Self-citationFactorial Learning and the EM Algorithm
Ghahramani, Z. (1994) · Cited by 67
Self-citationMixtures of Controllers for Jump Linear and Non-Linear Plants
Cacciatore, T. W., & Nowlan, S. J. (1993) · Cited by 62
Mean field networks that learn to discriminate temporally distorted strings
Williams, C. K. I., & Hinton, G. E. (1991) · Elsevier eBooks · doi:10.1016/b978-1-4832-1448-1.50008-1 · Cited by 36
Learning Fine Motion by Markov Mixtures of Experts
Meilă, M., & Jordan, M. I. (1995) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 28
Self-citationProbabilistic Independence Networks for Hidden Markov Probability Models
Smyth, P., Heckerman, D. E., & Jordan, M. I. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/3349.003.0004 · Cited by 15
Self-citation
Cited by
Multimodal Machine Learning: A Survey and Taxonomy
Baltrusaitis, T., Ahuja, C., & Morency, L.-P. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2798607 · Cited by 5,018
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791
Self-citationAn introduction to MCMC for machine learning.
Andrieu, C., de Freitas, N., Doucet, A., & Jordan, M. I. (2003) · Machine Learning · doi:10.1023/a:1020281327116 · Cited by 2,451
Self-citationA Bayesian computer vision system for modeling human interactions
Oliver, N. M., Rosario, B., & Pentland, A. P. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868684 · Cited by 1,578
The hierarchical hidden Markov model: Analysis and applications
Fine, S., Singer, Y., & Tishby, N. (1998) · Machine Learning · doi:10.1023/a:1007469218079 · Cited by 906
Metadata
- Authors
- Ghahramani, Z., & Jordan, M. I.
- Publisher
- Defense Technical Information Center
- Published
- 1996-01-01
- OpenAlex
- W4245655784
- Cited by
- 254
- References
- 32
- Type
- report
- Language
- en
- Open access
- green
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
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.