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
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
Adaptive Computation and Machine Learning
(2012) · Boosting · doi:10.7551/mitpress/8291.003.0026 · Cited by 1,402
Factorial Hidden Markov Models
Ghahramani, Z., & Jordan, M. I. (1997) · Machine Learning · doi:10.1023/a:1007425814087 · Cited by 1,157
Self-citationCoupled hidden Markov models for complex action recognition
Brand, M., Oliver, N., & Pentland, A. (2002) · Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1997.609450 · Cited by 1,052
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
A Unifying Review of Linear Gaussian Models
Roweis, S., & Ghahramani, Z. (1999) · Neural Computation · doi:10.1162/089976699300016674 · Cited by 869
AN INTRODUCTION TO HIDDEN MARKOV MODELS AND BAYESIAN NETWORKS
GHAHRAMANI, Z. (2001) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001401000836 · Cited by 700
Learning the Structure of Dynamic Probabilistic Networks
Friedman, N., Murphy, K., & Russell, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7374 · Cited by 561
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_5 · Cited by 551
Self-citationLearning dynamic Bayesian networks
Ghahramani, Z. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0053999 · Cited by 543
Tractable Inference for Complex Stochastic Processes
Boyen, X., & Koller, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7362 · Cited by 471
Correctness of Local Probability Propagation in Graphical Models with Loops
Weiss, Y. (2000) · Neural Computation · doi:10.1162/089976600300015880 · Cited by 452
Variational Learning for Switching State-Space Models
Ghahramani, Z., & Hinton, G. E. (2000) · Neural Computation · doi:10.1162/089976600300015619 · Cited by 422
Adaptive Probabilistic Networks with Hidden Variables
Binder, J., Koller, D., Russell, S., & Kanazawa, K. (1997) · Machine Learning · doi:10.1023/a:1007421730016 · Cited by 377
Freeman, W. T., & Pasztor, E. C. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790414 · Cited by 345
Multiresolution Markov models for signal and image processing
Willsky, A. S. (2002) · Proceedings of the IEEE · doi:10.1109/jproc.2002.800717 · Cited by 305
BILMES, J. A. (2006) · IEICE Transactions on Information and Systems · doi:10.1093/ietisy/e89-d.3.869 · Cited by 172
A hybrid learning system for recognizing user tasks from desktop activities and email messages
Shen, J., Li, L., Dietterich, T. G., & Herlocker, J. L. (2006) · Proceedings of the 11th international conference on Intelligent user interfaces · doi:10.1145/1111449.1111473 · Cited by 109
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.