The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Probabilistic Independence Networks for Hidden Markov Probability Models
Abstract
Graphical techniques for modeling the dependencies of random variables have been explored in a variety of different areas, including statistics, statistical physics, artificial intelligence, speech recognition, image processing, and genetics. Formalisms for manipulating these models have been developed relatively independently in these research communities. In this paper we explore hidden Markov models (HMMs) and related structures within the general framework of probabilistic independence networks (PINs). The paper presents a self-contained review of the basic principles of PINs. It is shown that the well-known forward-backward (F-B) and Viterbi algorithms for HMMs are special cases of more general inference algorithms for arbitrary PINs. Furthermore, the existence of inference and estimation algorithms for more general graphical models provides a set of analysis tools for HMM practitioners who wish to explore a richer class of HMM structures. Examples of relatively complex models to handle sensor fusion and coarticulation in speech recognition are introduced and treated within the graphical model framework to illustrate the advantages of the general approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
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 · cited 5×
“In practice, the F-B algorithm (Poritz 1988; Rabiner 1989) can perform these inference calculations with much lower complexity, namely Nm 2 .”
InfluentialStochastic 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
(1988) · Cited by 16,582
Bayesian model selection in social research
Raftery, A. E. (1995) · Sociological Methodology · doi:10.2307/271063 · Cited by 6,823
Discrete Multivariate Analysis: Theory and Practice.
Beniger, J. R., Bishop, Y. M. M., Feinberg, S. E., Holland, P. W., Light, R. J., & Mosteller, F. (1975) · Contemporary Sociology · doi:10.2307/2063625 · Cited by 5,108
MacKay, D. J. C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.415 · Cited by 4,388
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
Optimal Statistical Decisions.
Siegmund, D., & DeGroot, M. H. (1972) · Journal of the American Statistical Association · doi:10.2307/2284675 · Cited by 3,386
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1023/a:1022623210503 · Cited by 3,231
Self-citationA practical Bayesian framework for backpropagation networks
MacKay, D. J. C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.448 · Cited by 2,917
Nonuniversal critical dynamics in Monte Carlo simulations
Swendsen, R. H., & Wang, J.-S. (1987) · Physical Review Letters · doi:10.1103/physrevlett.58.86 · Cited by 2,844
Statistical Inference for Probabilistic Functions of Finite State Markov Chains
Baum, L. E., & Petrie, T. (1966) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177699147 · Cited by 2,775
Maximum a posteriori estimation for multivariate Gaussian mixture observations of Markov chains
Gauvain, J.-L., & Lee, C.-H. (1994) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/89.279278 · Cited by 2,108
Learning Bayesian networks: The combination of knowledge and statistical data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1007/bf00994016 · Cited by 2,017
Self-citationProceedings IEEE International Conference on Acoustics Speech and Signal Processing
Zheng, F., McLaughlin, S., & Mulgrew, B. (1991) · Cited by 1,905
Graphical Models in Applied Multivariate Statistics
Goodall, C. R. (1991) · Technometrics · doi:10.1080/00401706.1991.10484880 · Cited by 1,849
Explaining Phonetic Variation: A Sketch of the H&H Theory
Lindblom, B. (1990) · Speech Production and Speech Modelling · doi:10.1007/978-94-009-2037-8_16 · Cited by 1,824
Wavelet-based statistical signal processing using hidden Markov models
Crouse, M. S., Nowak, R. D., & Baraniuk, R. G. (1998) · IEEE Transactions on Signal Processing · doi:10.1109/78.668544 · Cited by 1,643
(1995) · Stochastic Modelling and Applied Probability · doi:10.1007/978-0-387-84854-9 · Cited by 1,432
Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
Madigan, D., & Raftery, A. E. (1994) · Journal of the American Statistical Association · doi:10.1080/01621459.1994.10476894 · Cited by 1,205 · cited 1×
“Detailed discussions of search methods for model selection among PINs are given by, among others, Madigan and Raftery (1994) , Heckerman et al. (1995), and Spirtes and Meek (1995).”
Factorial Hidden Markov Models
Ghahramani, Z., & Jordan, M. I. (1997) · Machine Learning · doi:10.1023/a:1007425814087 · Cited by 1,157
Self-citationLearning 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
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
Itzykson, C., & Drouffe, J.-M. (1989) · doi:10.1017/cbo9780511622779 · Cited by 885
Hidden Markov Models for Speech Recognition
Huang, X., Ariki, Y., & Jack, M. A. (1991) · Medical Entomology and Zoology · Cited by 744
Lauritzen, S. L., & Wermuth, N. (1989) · The Annals of Statistics · doi:10.1214/aos/1176347003 · Cited by 672
Operations for Learning with Graphical Models
Buntine, W. L. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.62 · Cited by 530
Sequential updating of conditional probabilities on directed graphical structures
Spiegelhalter, D. J., & Lauritzen, S. L. (1990) · Networks · doi:10.1002/net.3230200507 · Cited by 521
Independence properties of directed markov fields
Lauritzen, S. L., Dawid, A. P., Larsen, B. N., & Leimer, H. ‐. (1990) · Networks · doi:10.1002/net.3230200503 · Cited by 515
A guide to the literature on learning probabilistic networks from data
Buntine, W. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.494161 · Cited by 468
Rissanen, J. (1987) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1987.tb01694.x · Cited by 339
Magnetic correlations in two-dimensional spin-glasses
Morgenstern, I., & Binder, K. (1980) · Physical Review B · doi:10.1103/physrevb.22.288 · Cited by 304
Coarticulation in recent speech production models
Kent, R. D., & Minifie, F. D. (1977) · Journal of Phonetics · doi:10.1016/s0095-4470(19)31123-4 · Cited by 258
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 models: a guided tour
Poritz, A. B. (2003) · ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1988.196495 · Cited by 235
Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
Madigan, D., & Raftery, A. E. (1994) · Journal of the American Statistical Association · doi:10.2307/2291017 · Cited by 212
Exploiting Tractable Substructures in Intractable Networks
Saul, L. K., & Jordan, M. I. (1995) · Cited by 203
Self-citationPerkell, J. S., Matthies, M. L., Svirsky, M. A., & Jordan, M. I. (1993) · The Journal of the Acoustical Society of America · doi:10.1121/1.405814 · Cited by 168
Self-citationLearning Bayesian networks with discrete variables from data
Spirtes, P., & Meek, C. (1995) · Cited by 162
A Markov random field model-based approach to image interpretation
Modestino, J. W., & Zhang, J. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.141552 · Cited by 128
Belief networks, hidden Markov models, and Markov random fields: A unifying view
Smyth, P. (1997) · Pattern Recognition Letters · doi:10.1016/s0167-8655(97)01050-7 · Cited by 95
Self-citationGlobal Conditioning for Probabilistic Inference in Belief Networks
Shachter, R. D., Andersen, S. K., & Szolovits, P. (1994) · Elsevier eBooks · doi:10.1016/b978-1-55860-332-5.50070-5 · Cited by 89
An Introduction to Spatial Point Processes and Markov Random Fields
Isham, V. S. (1981) · International Statistical Review · doi:10.2307/1403035 · Cited by 80
On the effective implementation of the iterative proportional fitting procedure
Jiroušek, R., & Přeučil, S. (1995) · Computational Statistics & Data Analysis · doi:10.1016/0167-9473(93)e0055-9 · Cited by 77
Boltzmann Chains and Hidden Markov Models
Saul, L. K., & Jordan, M. I. (1994) · Cited by 68
Self-citationMean 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
Low complexity speaker independent command word recognition in car environments
Riis, S. K., & Viikki, O. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2000.862089 · Cited by 10
Recursive approaches to the statistical physics of lattice proteins
Stolorz (1994) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.1994.323565 · Cited by 9
Cited by
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-citation(2003) · Cited by 1,680
Wavelet-based statistical signal processing using hidden Markov models
Crouse, M. S., Nowak, R. D., & Baraniuk, R. G. (1998) · IEEE Transactions on Signal Processing · doi:10.1109/78.668544 · Cited by 1,643
A 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
Freeman, W. T., Pasztor, E. C., & Carmichael, O. T. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026501619075 · Cited by 1,459
Metadata
- Authors
- Smyth, P., Heckerman, D., & Jordan, M. I.
- Venue
- Neural Computation
- Publisher
- MIT Press
- Published
- 1997-02-01
- Volume
- 9
- Issue
- 2
- Pages
- 227-269
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2147496287
- Cited by
- 257
- References
- 50
- FWCI
- 22.82
- 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
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.