The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Theory and Use of the EM Algorithm
Abstract
Theory and Use of the EM Algorithm introduces the expectation-maximization (EM) algorithm and provides an intuitive and mathematically rigorous understanding of this method. It describes in detail two of the most popular applications of EM: estimating Gaussian mixture models (GMMs), and estimating hidden Markov models (HMMs). It also covers the use of EM for learning an optimal mixture of fixed models, for estimating the parameters of a compound Dirichlet distribution, and for disentangling superimposed signals. It discusses problems that arise in practice with EM, and variants of the algorithm that help deal with these challenges. Theory and Use of the EM Algorithm is designed to be useful to both the EM novice and the experienced EM user looking to better understand the method and its use.
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
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
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
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
McLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
Bayesian-Based Iterative Method of Image Restoration*
Richardson, W. H. (1972) · Journal of the Optical Society of America · doi:10.1364/josa.62.000055 · Cited by 4,160
An iterative technique for the rectification of observed distributions
Lucy, L. B. (1974) · The Astronomical Journal · doi:10.1086/111605 · Cited by 3,866
A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants
Neal, R. M., & Hinton, G. E. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_12 · Cited by 2,187
Cited by
Lü, L., Medo, M., Yeung, C. H., Zhang, Y.-C., Zhang, Z.-K., & Zhou, T. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.02.006 · Cited by 995
Sensitivity and specificity of information criteria
(2019) · doi:10.1093/bib/bbz016 · Cited by 718
An Integrated Pipeline for de Novo Assembly of Microbial Genomes
Tritt, A., Eisen, J. A., Facciotti, M. T., & Darling, A. E. (2012) · PLoS ONE · doi:10.1371/journal.pone.0042304 · Cited by 437
An Overview of Voice Conversion and Its Challenges: From Statistical Modeling to Deep Learning
Sisman, B., Yamagishi, J., King, S., & Li, H. (2021) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2020.3038524 · Cited by 357
Automatic License Plate Recognition via sliding-window darknet-YOLO deep learning
Hendry, & Chen, R.-C. (2019) · Image and Vision Computing · doi:10.1016/j.imavis.2019.04.007 · Cited by 304
Metadata
- Authors
- Gupta, M. R.
- Venue
- now publishers, Inc. eBooks
- Publisher
- now Publishers Inc
- Published
- 2010
- OpenAlex
- W2171717581
- Cited by
- 212
- References
- 7
- FWCI
- 5.03
- Type
- book
- 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.